%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL131-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 14:28:07 EDT 2022
% Result : Unsatisfiable 2.25s 2.48s
% Output : Refutation 2.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL131-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n013.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jul 3 10:07:14 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n013.cluster.edu,
% 0.12/0.34 Sun Jul 3 10:07:14 2022
% 0.12/0.34 The command was "./sos". The process ID is 13193.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a Horn set without equality. The strategy will
% 0.12/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.34 in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.36
% 0.12/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.36
% 0.12/0.36 Stopped by limit on number of solutions
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 -------------- Softie stats --------------
% 0.12/0.36
% 0.12/0.36 UPDATE_STOP: 300
% 0.12/0.36 SFINDER_TIME_LIMIT: 2
% 0.12/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.36 number of clauses in intial UL: 2
% 0.12/0.36 number of clauses initially in problem: 3
% 0.12/0.36 percentage of clauses intially in UL: 66
% 0.12/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.36 percent of all initial clauses that are short: 100
% 0.12/0.36 absolute distinct symbol count: 6
% 0.12/0.36 distinct predicate count: 1
% 0.12/0.36 distinct function count: 1
% 0.12/0.36 distinct constant count: 4
% 0.12/0.36
% 0.12/0.36 ---------- no more Softie stats ----------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 =========== start of search ===========
% 0.81/1.00
% 0.81/1.00
% 0.81/1.00 Changing weight limit from 60 to 36.
% 0.81/1.00
% 0.81/1.00 Model 2 (0.00 seconds, 0 Inserts)
% 0.81/1.00
% 0.81/1.00 Stopped by limit on number of solutions
% 0.81/1.00
% 0.81/1.00 Model 3 (0.00 seconds, 0 Inserts)
% 0.81/1.00
% 0.81/1.00 Stopped by limit on number of solutions
% 0.81/1.00
% 0.81/1.00 Model 4 (0.00 seconds, 0 Inserts)
% 0.81/1.00
% 0.81/1.00 Stopped by limit on number of solutions
% 0.81/1.00
% 0.81/1.00 Model 5 (0.00 seconds, 0 Inserts)
% 0.81/1.00
% 0.81/1.00 Stopped by limit on number of solutions
% 0.81/1.00
% 0.81/1.00 Resetting weight limit to 36 after 95 givens.
% 0.81/1.00
% 0.88/1.09
% 0.88/1.09
% 0.88/1.09 Changing weight limit from 36 to 28.
% 0.88/1.09
% 0.88/1.09 Resetting weight limit to 28 after 100 givens.
% 0.88/1.09
% 1.08/1.32
% 1.08/1.32
% 1.08/1.32 Changing weight limit from 28 to 24.
% 1.08/1.32
% 1.08/1.32 Resetting weight limit to 24 after 115 givens.
% 1.08/1.32
% 2.25/2.48
% 2.25/2.48 -------- PROOF --------
% 2.25/2.48 % SZS status Unsatisfiable
% 2.25/2.48 % SZS output start Refutation
% 2.25/2.48
% 2.25/2.48 ----> UNIT CONFLICT at 2.06 sec ----> 9764 [binary,9763.1,2.1] {-} $F.
% 2.25/2.48
% 2.25/2.48 Length of proof is 19. Level of proof is 10.
% 2.25/2.48
% 2.25/2.48 ---------------- PROOF ----------------
% 2.25/2.48 % SZS status Unsatisfiable
% 2.25/2.48 % SZS output start Refutation
% 2.25/2.48
% 2.25/2.48 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.25/2.48 2 [] {+} -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 2.25/2.48 3 [] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),equivalent(B,D))),A)).
% 2.25/2.48 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C)),equivalent(equivalent(equivalent(D,E),equivalent(F,E)),equivalent(D,F)))).
% 2.25/2.48 5 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 2.25/2.48 6 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),D),equivalent(equivalent(A,C),D))).
% 2.25/2.48 7 [hyper,5,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))).
% 2.25/2.48 9 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),C)),equivalent(A,D))).
% 2.25/2.48 10 [hyper,6,1,5] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 2.25/2.48 11 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(A,equivalent(B,D)))).
% 2.25/2.48 12 [hyper,10,1,6] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 2.25/2.48 15 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),equivalent(B,D))),E),equivalent(A,E))).
% 2.25/2.48 16 [hyper,12,1,12] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))).
% 2.25/2.48 33 [hyper,11,1,6] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))).
% 2.25/2.48 36 [hyper,11,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(equivalent(D,E),equivalent(F,E)),equivalent(D,F))),equivalent(A,C))).
% 2.25/2.48 39 [hyper,16,1,11] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(B,D))),equivalent(equivalent(A,D),C))).
% 2.25/2.48 96 [hyper,33,1,7] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(C,C)),B))).
% 2.25/2.48 111 [hyper,96,1,11] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,C))),equivalent(A,B))).
% 2.25/2.48 177 [hyper,15,1,9] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,B)),equivalent(A,equivalent(D,C)))).
% 2.25/2.48 1260 [hyper,177,1,111] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 2.25/2.48 1289 [hyper,1260,1,39] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),D),A)).
% 2.25/2.48 9763 [hyper,1289,1,36] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))).
% 2.25/2.48 9764 [binary,9763.1,2.1] {-} $F.
% 2.25/2.48
% 2.25/2.48 % SZS output end Refutation
% 2.25/2.48 ------------ end of proof -------------
% 2.25/2.48
% 2.25/2.48
% 2.25/2.48 Search stopped by max_proofs option.
% 2.25/2.48
% 2.25/2.48
% 2.25/2.48 Search stopped by max_proofs option.
% 2.25/2.48
% 2.25/2.48 ============ end of search ============
% 2.25/2.48
% 2.25/2.48 ----------- soft-scott stats ----------
% 2.25/2.48
% 2.25/2.48 true clauses given 20 (9.7%)
% 2.25/2.48 false clauses given 187
% 2.25/2.48
% 2.25/2.48 FALSE TRUE
% 2.25/2.48 16 81 144
% 2.25/2.48 20 2080 436
% 2.25/2.48 24 416 228
% 2.25/2.48 tot: 2577 808 (23.9% true)
% 2.25/2.48
% 2.25/2.48
% 2.25/2.48 Model 5 (0.00 seconds, 0 Inserts)
% 2.25/2.48
% 2.25/2.48 That finishes the proof of the theorem.
% 2.25/2.48
% 2.25/2.48 Process 13193 finished Sun Jul 3 10:07:16 2022
%------------------------------------------------------------------------------