%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:04 EDT 2022
% Result : Unsatisfiable 16.73s 16.95s
% Output : Refutation 16.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 2 14:09:23 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n008.cluster.edu,
% 0.14/0.38 Sat Jul 2 14:09:23 2022
% 0.14/0.38 The command was "./sos". The process ID is 27714.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.38
% 0.14/0.38 This is a Horn set without equality. The strategy will
% 0.14/0.38 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.38 in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: clear(order_hyper).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 2
% 0.14/0.40 number of clauses initially in problem: 3
% 0.14/0.40 percentage of clauses intially in UL: 66
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 7
% 0.14/0.40 distinct predicate count: 1
% 0.14/0.40 distinct function count: 1
% 0.14/0.40 distinct constant count: 5
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 6.83/7.08
% 6.83/7.08
% 6.83/7.08 Changing weight limit from 60 to 44.
% 6.83/7.08
% 6.83/7.08 Model 2 (0.00 seconds, 0 Inserts)
% 6.83/7.08
% 6.83/7.08 Stopped by limit on number of solutions
% 6.83/7.08
% 6.83/7.08 Stopped by limit on insertions
% 6.83/7.08
% 6.83/7.08 Model 3 (0.00 seconds, 0 Inserts)
% 6.83/7.08
% 6.83/7.08 Stopped by limit on number of solutions
% 6.83/7.08
% 6.83/7.08 Resetting weight limit to 44 after 105 givens.
% 6.83/7.08
% 7.05/7.31
% 7.05/7.31
% 7.05/7.31 Changing weight limit from 44 to 32.
% 7.05/7.31
% 7.05/7.31 Resetting weight limit to 32 after 110 givens.
% 7.05/7.31
% 7.14/7.36
% 7.14/7.36
% 7.14/7.36 Changing weight limit from 32 to 28.
% 7.14/7.36
% 7.14/7.36 Resetting weight limit to 28 after 115 givens.
% 7.14/7.36
% 7.29/7.47
% 7.29/7.47
% 7.29/7.47 Changing weight limit from 28 to 24.
% 7.29/7.47
% 7.29/7.47 Resetting weight limit to 24 after 125 givens.
% 7.29/7.47
% 16.73/16.95
% 16.73/16.95 -- HEY sandbox2, WE HAVE A PROOF!! --
% 16.73/16.95
% 16.73/16.95 Modelling stopped after 300 given clauses and 0.00 seconds
% 16.73/16.95
% 16.73/16.95
% 16.73/16.95 ----> UNIT CONFLICT at 16.40 sec ----> 66086 [binary,66085.1,2.1] {-} $F.
% 16.73/16.95
% 16.73/16.95 Length of proof is 22. Level of proof is 17.
% 16.73/16.95
% 16.73/16.95 ---------------- PROOF ----------------
% 16.73/16.95 % SZS status Unsatisfiable
% 16.73/16.95 % SZS output start Refutation
% 16.73/16.95
% 16.73/16.95 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 16.73/16.95 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),equivalent(e,equivalent(b,f))),equivalent(a,equivalent(e,equivalent(c,f))))).
% 16.73/16.95 3 [] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))).
% 16.73/16.95 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D))))),equivalent(equivalent(E,F),equivalent(equivalent(E,G),equivalent(F,G))))).
% 16.73/16.95 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 16.73/16.95 7 [hyper,6,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))).
% 16.73/16.95 14 [hyper,7,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))).
% 16.73/16.95 17 [hyper,14,1,14] {+} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,B),C))).
% 16.73/16.95 21 [hyper,14,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),E),equivalent(equivalent(A,equivalent(B,D)),E))).
% 16.73/16.95 25 [hyper,17,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(D,C)),equivalent(equivalent(A,B),D))).
% 16.73/16.95 30 [hyper,25,1,17] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 16.73/16.95 31 [hyper,25,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(A,equivalent(B,D)))).
% 16.73/16.95 32 [hyper,30,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 16.73/16.95 35 [hyper,32,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),D),equivalent(equivalent(A,C),D))).
% 16.73/16.95 37 [hyper,32,1,30] {+} is_a_theorem(equivalent(A,A)).
% 16.73/16.95 49 [hyper,35,1,31] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(D,C)),equivalent(A,D))).
% 16.73/16.95 53 [hyper,35,1,31] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))).
% 16.73/16.95 121 [hyper,49,1,31] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))).
% 16.73/16.95 127 [hyper,121,1,14] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(C,C)),B))).
% 16.73/16.95 216 [hyper,127,1,37] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)).
% 16.73/16.95 237 [hyper,216,1,14] {+} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,B)),C),equivalent(A,C))).
% 16.73/16.95 1415 [hyper,21,1,53] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,equivalent(C,E))),equivalent(equivalent(B,E),D)))).
% 16.73/16.95 1645 [hyper,237,1,53] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)))).
% 16.73/16.95 1665 [hyper,1645,1,53] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(equivalent(A,equivalent(D,C)),B))).
% 16.73/16.95 66085 [hyper,1415,1,1665] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,equivalent(B,E))),equivalent(A,equivalent(D,equivalent(C,E))))).
% 16.73/16.95 66086 [binary,66085.1,2.1] {-} $F.
% 16.73/16.95
% 16.73/16.95 % SZS output end Refutation
% 16.73/16.95 ------------ end of proof -------------
% 16.73/16.95
% 16.73/16.95
% 16.73/16.95 Search stopped by max_proofs option.
% 16.73/16.95
% 16.73/16.95
% 16.73/16.95 Search stopped by max_proofs option.
% 16.73/16.95
% 16.73/16.95 ============ end of search ============
% 16.73/16.95
% 16.73/16.95 ----------- soft-scott stats ----------
% 16.73/16.95
% 16.73/16.95 true clauses given 168 (20.9%)
% 16.73/16.95 false clauses given 636
% 16.73/16.95
% 16.73/16.95 FALSE TRUE
% 16.73/16.95 16 0 67
% 16.73/16.95 20 2520 881
% 16.73/16.95 24 785 1593
% 16.73/16.95 tot: 3305 2541 (43.5% true)
% 16.73/16.95
% 16.73/16.95
% 16.73/16.95 Model 3 (0.00 seconds, 0 Inserts)
% 16.73/16.95
% 16.73/16.95 That finishes the proof of the theorem.
% 16.73/16.95
% 16.73/16.95 Process 27714 finished Sat Jul 2 14:09:39 2022
%------------------------------------------------------------------------------