%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL126-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:05 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL126-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 01:27:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n012.cluster.edu,
% 0.12/0.34 Sun Jul 3 01:27:17 2022
% 0.12/0.34 The command was "./sos". The process ID is 22511.
% 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.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 2
% 0.12/0.37 number of clauses initially in problem: 4
% 0.12/0.37 percentage of clauses intially in UL: 50
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 5
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 1
% 0.12/0.37 distinct constant count: 3
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.19/0.39
% 0.19/0.39 -------- PROOF --------
% 0.19/0.39 % SZS status Unsatisfiable
% 0.19/0.39 % SZS output start Refutation
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 ----> UNIT CONFLICT at 0.01 sec ----> 63 [binary,62.1,2.1] {-} $F.
% 0.19/0.39
% 0.19/0.39 Length of proof is 9. Level of proof is 7.
% 0.19/0.39
% 0.19/0.39 ---------------- PROOF ----------------
% 0.19/0.39 % SZS status Unsatisfiable
% 0.19/0.39 % SZS output start Refutation
% 0.19/0.39
% 0.19/0.39 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.39 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))).
% 0.19/0.39 3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)))).
% 0.19/0.39 4 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 0.19/0.39 5 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B))),equivalent(D,E)),equivalent(E,D))).
% 0.19/0.39 6 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))).
% 0.19/0.39 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C))),equivalent(D,E)),equivalent(E,D))).
% 0.19/0.39 12 [hyper,6,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))).
% 0.19/0.39 30 [hyper,5,1,12] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),D),equivalent(A,D))).
% 0.19/0.39 36 [hyper,30,1,30] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,C)))).
% 0.19/0.39 48 [hyper,36,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 0.19/0.39 50 [hyper,48,1,30] {+} is_a_theorem(equivalent(A,A)).
% 0.19/0.39 62 [hyper,50,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 0.19/0.39 63 [binary,62.1,2.1] {-} $F.
% 0.19/0.39
% 0.19/0.39 % SZS output end Refutation
% 0.19/0.39 ------------ end of proof -------------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Search stopped by max_proofs option.
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Search stopped by max_proofs option.
% 0.19/0.39
% 0.19/0.39 ============ end of search ============
% 0.19/0.39
% 0.19/0.39 ----------- soft-scott stats ----------
% 0.19/0.39
% 0.19/0.39 true clauses given 2 (15.4%)
% 0.19/0.39 false clauses given 11
% 0.19/0.39
% 0.19/0.39 FALSE TRUE
% 0.19/0.39 16 5 0
% 0.19/0.39 20 20 0
% 0.19/0.39 24 14 0
% 0.19/0.39 28 4 0
% 0.19/0.39 tot: 43 0 (0.0% true)
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 That finishes the proof of the theorem.
% 0.19/0.39
% 0.19/0.39 Process 22511 finished Sun Jul 3 01:27:17 2022
%------------------------------------------------------------------------------