%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL088-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:27:51 EDT 2022
% Result : Unsatisfiable 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL088-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n028.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 : Mon Jul 4 12:11:19 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.33 ----- Otter 3.2, August 2001 -----
% 0.12/0.33 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.33 Mon Jul 4 12:11:19 2022
% 0.12/0.33 The command was "./sos". The process ID is 24876.
% 0.12/0.33
% 0.12/0.33 set(prolog_style_variables).
% 0.12/0.33 set(auto).
% 0.12/0.33 dependent: set(auto1).
% 0.12/0.33 dependent: set(process_input).
% 0.12/0.33 dependent: clear(print_kept).
% 0.12/0.33 dependent: clear(print_new_demod).
% 0.12/0.33 dependent: clear(print_back_demod).
% 0.12/0.33 dependent: clear(print_back_sub).
% 0.12/0.33 dependent: set(control_memory).
% 0.12/0.33 dependent: assign(max_mem, 12000).
% 0.12/0.33 dependent: assign(pick_given_ratio, 4).
% 0.12/0.33 dependent: assign(stats_level, 1).
% 0.12/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.33 dependent: assign(sos_limit, 5000).
% 0.12/0.33 dependent: assign(max_weight, 60).
% 0.12/0.33 clear(print_given).
% 0.12/0.33
% 0.12/0.33 list(usable).
% 0.12/0.33
% 0.12/0.33 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.33
% 0.12/0.33 This is a Horn set without equality. The strategy will
% 0.12/0.33 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.33 in usable.
% 0.12/0.33
% 0.12/0.33 dependent: set(hyper_res).
% 0.12/0.33 dependent: clear(order_hyper).
% 0.12/0.33
% 0.12/0.33 ------------> process usable:
% 0.12/0.33
% 0.12/0.33 ------------> process sos:
% 0.12/0.33
% 0.12/0.33 ======= 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: 4
% 0.12/0.36 distinct predicate count: 1
% 0.12/0.36 distinct function count: 1
% 0.12/0.36 distinct constant count: 2
% 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.17/0.50
% 0.17/0.50 -------- PROOF --------
% 0.17/0.50 % SZS status Unsatisfiable
% 0.17/0.50 % SZS output start Refutation
% 0.17/0.50
% 0.17/0.50 Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.50
% 0.17/0.50 Stopped by limit on number of solutions
% 0.17/0.50
% 0.17/0.50 Model 3 (0.00 seconds, 0 Inserts)
% 0.17/0.50
% 0.17/0.50 Stopped by limit on number of solutions
% 0.17/0.50
% 0.17/0.50 Model 4 (0.00 seconds, 0 Inserts)
% 0.17/0.50
% 0.17/0.50 Stopped by limit on number of solutions
% 0.17/0.50
% 0.17/0.50 ----> UNIT CONFLICT at 0.12 sec ----> 131 [binary,130.1,2.1] {+} $F.
% 0.17/0.50
% 0.17/0.50 Length of proof is 16. Level of proof is 12.
% 0.17/0.50
% 0.17/0.50 ---------------- PROOF ----------------
% 0.17/0.50 % SZS status Unsatisfiable
% 0.17/0.50 % SZS output start Refutation
% 0.17/0.50
% 0.17/0.50 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.17/0.50 2 [] {+} -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 0.17/0.50 3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))).
% 0.17/0.50 4 [hyper,3,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),implies(C,E)),implies(F,implies(C,E))))).
% 0.17/0.50 5 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 0.17/0.50 7 [hyper,5,1,5] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))).
% 0.17/0.50 9 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,C))))).
% 0.17/0.50 10 [hyper,7,1,7] {+} is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))).
% 0.17/0.50 12 [hyper,10,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))).
% 0.17/0.50 20 [hyper,9,1,9] {-} is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))).
% 0.17/0.50 23 [hyper,20,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(implies(implies(D,E),C),D)))).
% 0.17/0.50 32 [hyper,12,1,12] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))).
% 0.17/0.50 37 [hyper,32,1,5] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 0.17/0.50 44 [hyper,37,1,37] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.17/0.50 49 [hyper,44,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))).
% 0.17/0.50 83 [hyper,49,1,49] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 0.17/0.50 109 [hyper,23,1,23] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(C,D),B),C))).
% 0.17/0.50 122 [hyper,109,1,83] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 0.17/0.50 130 [hyper,122,1,122] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 0.17/0.50 131 [binary,130.1,2.1] {+} $F.
% 0.17/0.50
% 0.17/0.50 % SZS output end Refutation
% 0.17/0.50 ------------ end of proof -------------
% 0.17/0.50
% 0.17/0.50
% 0.17/0.50 Search stopped by max_proofs option.
% 0.17/0.50
% 0.17/0.50
% 0.17/0.50 Search stopped by max_proofs option.
% 0.17/0.50
% 0.17/0.50 ============ end of search ============
% 0.17/0.50
% 0.17/0.50 ----------- soft-scott stats ----------
% 0.17/0.50
% 0.17/0.50 true clauses given 4 (14.3%)
% 0.17/0.50 false clauses given 24
% 0.17/0.50
% 0.17/0.50 FALSE TRUE
% 0.17/0.50 4 0 1
% 0.17/0.50 8 0 1
% 0.17/0.50 10 0 4
% 0.17/0.50 12 1 5
% 0.17/0.50 14 0 8
% 0.17/0.50 16 5 5
% 0.17/0.50 18 8 5
% 0.17/0.50 20 7 3
% 0.17/0.50 22 3 4
% 0.17/0.50 24 2 3
% 0.17/0.50 26 2 3
% 0.17/0.50 28 2 2
% 0.17/0.50 30 1 2
% 0.17/0.50 32 0 2
% 0.17/0.50 34 0 1
% 0.17/0.50 tot: 31 49 (61.2% true)
% 0.17/0.50
% 0.17/0.50
% 0.17/0.50 Model 4 (0.00 seconds, 0 Inserts)
% 0.17/0.50
% 0.17/0.50 That finishes the proof of the theorem.
% 0.17/0.50
% 0.17/0.50 Process 24876 finished Mon Jul 4 12:11:19 2022
%------------------------------------------------------------------------------