%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL363-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:29:42 EDT 2022
% Result : Unsatisfiable 4.20s 4.42s
% Output : Refutation 4.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL363-1 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 : Sat Jul 2 20:06:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.12/0.35 Sat Jul 2 20:06:45 2022
% 0.12/0.35 The command was "./sos". The process ID is 25231.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 2
% 0.18/0.37 number of clauses initially in problem: 5
% 0.18/0.37 percentage of clauses intially in UL: 40
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 5
% 0.18/0.37 distinct predicate count: 1
% 0.18/0.37 distinct function count: 2
% 0.18/0.37 distinct constant count: 2
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 4.20/4.42
% 4.20/4.42 -------- PROOF --------
% 4.20/4.42 % SZS status Unsatisfiable
% 4.20/4.42 % SZS output start Refutation
% 4.20/4.42
% 4.20/4.42 Model 2 (0.00 seconds, 0 Inserts)
% 4.20/4.42
% 4.20/4.42 Stopped by limit on number of solutions
% 4.20/4.42
% 4.20/4.42 Model 3 (0.00 seconds, 0 Inserts)
% 4.20/4.42
% 4.20/4.42 Stopped by limit on number of solutions
% 4.20/4.42
% 4.20/4.42 Stopped by limit on insertions
% 4.20/4.42
% 4.20/4.42 Model 4 [ 1 0 86 ] (0.00 seconds, 250000 Inserts)
% 4.20/4.42
% 4.20/4.42 ----> UNIT CONFLICT at 4.05 sec ----> 412 [binary,411.1,2.1] {-} $F.
% 4.20/4.42
% 4.20/4.42 Length of proof is 13. Level of proof is 7.
% 4.20/4.42
% 4.20/4.42 ---------------- PROOF ----------------
% 4.20/4.42 % SZS status Unsatisfiable
% 4.20/4.42 % SZS output start Refutation
% 4.20/4.42
% 4.20/4.42 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.20/4.42 2 [] {+} -is_a_theorem(implies(x,implies(implies(not(y),y),y))).
% 4.20/4.42 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 4.20/4.42 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 4.20/4.42 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 4.20/4.42 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 4.20/4.42 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 4.20/4.42 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 4.20/4.42 14 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))).
% 4.20/4.42 32 [hyper,9,1,7] {-} is_a_theorem(implies(A,implies(implies(not(not(A)),not(A)),B))).
% 4.20/4.42 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 4.20/4.42 36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 4.20/4.42 45 [hyper,32,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(not(A)),not(A)),B),C),implies(A,C))).
% 4.20/4.42 97 [hyper,14,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))).
% 4.20/4.42 107 [hyper,45,1,6] {-} is_a_theorem(implies(implies(A,implies(not(not(B)),not(B))),implies(B,implies(A,C)))).
% 4.20/4.42 166 [hyper,107,1,36] {+} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 4.20/4.42 275 [hyper,166,1,97] {+} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 4.20/4.42 411 [hyper,275,1,7] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 4.20/4.42 412 [binary,411.1,2.1] {-} $F.
% 4.20/4.42
% 4.20/4.42 % SZS output end Refutation
% 4.20/4.42 ------------ end of proof -------------
% 4.20/4.42
% 4.20/4.42
% 4.20/4.42 Search stopped by max_proofs option.
% 4.20/4.42
% 4.20/4.42
% 4.20/4.42 Search stopped by max_proofs option.
% 4.20/4.42
% 4.20/4.42 ============ end of search ============
% 4.20/4.42
% 4.20/4.42 ----------- soft-scott stats ----------
% 4.20/4.42
% 4.20/4.42 true clauses given 11 (29.7%)
% 4.20/4.42 false clauses given 26
% 4.20/4.42
% 4.20/4.42 FALSE TRUE
% 4.20/4.42 11 0 1
% 4.20/4.42 12 0 9
% 4.20/4.42 13 0 9
% 4.20/4.42 14 0 11
% 4.20/4.42 15 0 10
% 4.20/4.42 16 0 19
% 4.20/4.42 17 2 11
% 4.20/4.42 18 3 13
% 4.20/4.42 19 14 8
% 4.20/4.42 20 9 17
% 4.20/4.42 21 11 12
% 4.20/4.42 22 7 7
% 4.20/4.42 23 11 3
% 4.20/4.42 24 3 1
% 4.20/4.42 25 17 1
% 4.20/4.42 26 6 0
% 4.20/4.42 27 14 0
% 4.20/4.42 28 3 0
% 4.20/4.42 29 12 0
% 4.20/4.42 30 4 1
% 4.20/4.42 31 16 0
% 4.20/4.42 32 2 0
% 4.20/4.42 33 8 0
% 4.20/4.42 34 1 0
% 4.20/4.42 35 13 0
% 4.20/4.42 37 17 0
% 4.20/4.42 39 9 0
% 4.20/4.42 41 13 0
% 4.20/4.42 43 4 0
% 4.20/4.42 45 4 0
% 4.20/4.42 49 1 0
% 4.20/4.42 tot: 204 133 (39.5% true)
% 4.20/4.42
% 4.20/4.42
% 4.20/4.42 Model 4 [ 1 0 86 ] (0.00 seconds, 250000 Inserts)
% 4.20/4.42
% 4.20/4.42 That finishes the proof of the theorem.
% 4.20/4.42
% 4.20/4.42 Process 25231 finished Sat Jul 2 20:06:49 2022
%------------------------------------------------------------------------------