%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL029-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:27:27 EDT 2022
% Result : Unsatisfiable 0.66s 0.88s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL029-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 09:15:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n013.cluster.edu,
% 0.13/0.37 Sun Jul 3 09:15:59 2022
% 0.13/0.37 The command was "./sos". The process ID is 28117.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This is a Horn set without equality. The strategy will
% 0.13/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37 in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 2
% 0.13/0.39 number of clauses initially in problem: 6
% 0.13/0.39 percentage of clauses intially in UL: 33
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 4
% 0.13/0.39 distinct predicate count: 1
% 0.13/0.39 distinct function count: 1
% 0.13/0.39 distinct constant count: 2
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.66/0.88
% 0.66/0.88 -------- PROOF --------
% 0.66/0.88 % SZS status Unsatisfiable
% 0.66/0.88 % SZS output start Refutation
% 0.66/0.88
% 0.66/0.88 Model 2 (0.00 seconds, 0 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on number of solutions
% 0.66/0.88
% 0.66/0.88 Model 3 (0.00 seconds, 0 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on number of solutions
% 0.66/0.88
% 0.66/0.88 Model 4 [ 1 0 17 ] (0.00 seconds, 32265 Inserts)
% 0.66/0.88
% 0.66/0.88 Model 5 [ 1 15 31241 ] (0.00 seconds, 31960 Inserts)
% 0.66/0.88
% 0.66/0.88 Model 6 [ 1 0 924 ] (0.00 seconds, 26931 Inserts)
% 0.66/0.88
% 0.66/0.88 ----> UNIT CONFLICT at 0.49 sec ----> 524 [binary,523.1,2.1] {-} $F.
% 0.66/0.88
% 0.66/0.88 Length of proof is 11. Level of proof is 6.
% 0.66/0.88
% 0.66/0.88 ---------------- PROOF ----------------
% 0.66/0.88 % SZS status Unsatisfiable
% 0.66/0.88 % SZS output start Refutation
% 0.66/0.88
% 0.66/0.88 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.66/0.88 2 [] {+} -is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)).
% 0.66/0.88 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 0.66/0.88 4 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.66/0.88 5 [] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 0.66/0.88 6 [] {+} is_a_theorem(implies(falsehood,A)).
% 0.66/0.88 7 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 0.66/0.88 11 [hyper,4,1,6] {+} is_a_theorem(implies(A,implies(falsehood,B))).
% 0.66/0.88 13 [hyper,5,1,4] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 0.66/0.88 16 [hyper,11,1,3] {+} is_a_theorem(implies(implies(implies(falsehood,A),B),implies(C,B))).
% 0.66/0.88 21 [hyper,7,1,5] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 0.66/0.88 33 [hyper,13,1,3] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),implies(D,C))).
% 0.66/0.88 80 [hyper,33,1,7] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(D,implies(A,B)))).
% 0.66/0.88 193 [hyper,21,1,80] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 0.66/0.88 195 [hyper,21,1,16] {+} is_a_theorem(implies(implies(implies(falsehood,A),B),B)).
% 0.66/0.88 335 [hyper,195,1,193] {-} is_a_theorem(implies(implies(implies(falsehood,A),implies(implies(B,C),B)),B)).
% 0.66/0.88 523 [hyper,335,1,7] {-} is_a_theorem(implies(implies(implies(A,B),falsehood),A)).
% 0.66/0.88 524 [binary,523.1,2.1] {-} $F.
% 0.66/0.88
% 0.66/0.88 % SZS output end Refutation
% 0.66/0.88 ------------ end of proof -------------
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Search stopped by max_proofs option.
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Search stopped by max_proofs option.
% 0.66/0.88
% 0.66/0.88 ============ end of search ============
% 0.66/0.88
% 0.66/0.88 ----------- soft-scott stats ----------
% 0.66/0.88
% 0.66/0.88 true clauses given 18 (32.7%)
% 0.66/0.88 false clauses given 37
% 0.66/0.88
% 0.66/0.88 FALSE TRUE
% 0.66/0.88 8 0 1
% 0.66/0.88 10 0 16
% 0.66/0.88 12 2 32
% 0.66/0.88 14 24 31
% 0.66/0.88 16 90 28
% 0.66/0.88 18 67 17
% 0.66/0.88 20 45 19
% 0.66/0.88 22 27 10
% 0.66/0.88 24 17 10
% 0.66/0.88 26 4 2
% 0.66/0.88 28 2 1
% 0.66/0.88 30 2 0
% 0.66/0.88 34 1 0
% 0.66/0.88 tot: 281 167 (37.3% true)
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Model 6 [ 1 0 924 ] (0.00 seconds, 26931 Inserts)
% 0.66/0.88
% 0.66/0.88 That finishes the proof of the theorem.
% 0.66/0.88
% 0.66/0.88 Process 28117 finished Sun Jul 3 09:16:00 2022
%------------------------------------------------------------------------------