%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL196-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:33 EDT 2022
% Result : Unsatisfiable 6.41s 6.67s
% Output : Refutation 6.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL196-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n004.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 : Sat Jul 2 18:04:08 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 sandbox on n004.cluster.edu,
% 0.13/0.37 Sat Jul 2 18:04:08 2022
% 0.13/0.37 The command was "./sos". The process ID is 29638.
% 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.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 4
% 0.20/0.41 number of clauses initially in problem: 9
% 0.20/0.41 percentage of clauses intially in UL: 44
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 6
% 0.20/0.41 distinct predicate count: 2
% 0.20/0.41 distinct function count: 2
% 0.20/0.41 distinct constant count: 2
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 6.41/6.67
% 6.41/6.67 -------- PROOF --------
% 6.41/6.67 % SZS status Unsatisfiable
% 6.41/6.67 % SZS output start Refutation
% 6.41/6.67
% 6.41/6.67 Stopped by limit on insertions
% 6.41/6.67
% 6.41/6.67 Stopped by limit on insertions
% 6.41/6.67
% 6.41/6.67 Stopped by limit on insertions
% 6.41/6.67
% 6.41/6.67 Stopped by limit on insertions
% 6.41/6.67
% 6.41/6.67 Model 3 [ 2 4 16471 ] (0.00 seconds, 250000 Inserts)
% 6.41/6.67
% 6.41/6.67 Stopped by limit on insertions
% 6.41/6.67
% 6.41/6.67 Model 4 [ 2 18 129840 ] (0.00 seconds, 250000 Inserts)
% 6.41/6.67
% 6.41/6.67 Stopped by limit on insertions
% 6.41/6.67
% 6.41/6.67 Model 5 [ 2 2 10337 ] (0.00 seconds, 250000 Inserts)
% 6.41/6.67
% 6.41/6.67 Model 6 (0.00 seconds, 250000 Inserts)
% 6.41/6.67
% 6.41/6.67 Stopped by limit on number of solutions
% 6.41/6.67
% 6.41/6.67 ----> UNIT CONFLICT at 6.28 sec ----> 1655 [binary,1654.1,4.1] {-} $F.
% 6.41/6.67
% 6.41/6.67 Length of proof is 9. Level of proof is 9.
% 6.41/6.67
% 6.41/6.67 ---------------- PROOF ----------------
% 6.41/6.67 % SZS status Unsatisfiable
% 6.41/6.67 % SZS output start Refutation
% 6.41/6.67
% 6.41/6.67 1 [] {+} theorem(A)| -axiom(A).
% 6.41/6.67 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 6.41/6.67 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 6.41/6.67 4 [] {+} -theorem(or(not(or(p,or(p,q))),or(p,q))).
% 6.41/6.67 5 [] {+} axiom(or(not(or(A,A)),A)).
% 6.41/6.67 6 [] {-} axiom(or(not(A),or(B,A))).
% 6.41/6.67 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 6.41/6.67 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 6.41/6.67 9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 6.41/6.67 17 [hyper,7,1] {-} theorem(or(not(or(A,B)),or(B,A))).
% 6.41/6.67 56 [hyper,17,3,6] {+} theorem(or(not(A),or(A,B))).
% 6.41/6.67 75 [hyper,56,2,9] {-} theorem(or(not(or(A,B)),or(A,or(B,C)))).
% 6.41/6.67 138 [hyper,75,2,8] {-} theorem(or(A,or(not(or(A,B)),or(B,C)))).
% 6.41/6.67 208 [hyper,138,2,7] {-} theorem(or(or(not(or(A,B)),or(B,C)),A)).
% 6.41/6.67 284 [hyper,208,2,6] {-} theorem(or(A,or(or(not(or(B,C)),or(C,D)),B))).
% 6.41/6.67 789 [hyper,284,2,8] {-} theorem(or(or(not(or(A,B)),or(B,C)),or(D,A))).
% 6.41/6.67 1651 [hyper,789,2,5] {-} theorem(or(not(or(or(A,B),A)),or(A,B))).
% 6.41/6.67 1654 [hyper,1651,3,7] {-} theorem(or(not(or(A,or(A,B))),or(A,B))).
% 6.41/6.67 1655 [binary,1654.1,4.1] {-} $F.
% 6.41/6.67
% 6.41/6.67 % SZS output end Refutation
% 6.41/6.67 ------------ end of proof -------------
% 6.41/6.67
% 6.41/6.67
% 6.41/6.67 Search stopped by max_proofs option.
% 6.41/6.67
% 6.41/6.67
% 6.41/6.67 Search stopped by max_proofs option.
% 6.41/6.67
% 6.41/6.67 ============ end of search ============
% 6.41/6.67
% 6.41/6.67 ----------- soft-scott stats ----------
% 6.41/6.67
% 6.41/6.67 true clauses given 111 (29.8%)
% 6.41/6.67 false clauses given 261
% 6.41/6.67
% 6.41/6.67 FALSE TRUE
% 6.41/6.67 9 0 3
% 6.41/6.67 11 0 114
% 6.41/6.67 12 0 2
% 6.41/6.67 13 125 72
% 6.41/6.67 14 2 6
% 6.41/6.67 15 269 42
% 6.41/6.67 16 7 4
% 6.41/6.67 17 181 44
% 6.41/6.67 18 14 3
% 6.41/6.67 19 113 21
% 6.41/6.67 20 11 1
% 6.41/6.67 21 60 15
% 6.41/6.67 22 11 1
% 6.41/6.67 23 28 11
% 6.41/6.67 24 2 2
% 6.41/6.67 25 16 1
% 6.41/6.67 26 4 0
% 6.41/6.67 27 1 1
% 6.41/6.67 28 1 1
% 6.41/6.67 29 3 1
% 6.41/6.67 31 3 1
% 6.41/6.67 33 2 1
% 6.41/6.67 37 1 0
% 6.41/6.67 tot: 854 347 (28.9% true)
% 6.41/6.67
% 6.41/6.67
% 6.41/6.67 Model 6 (0.00 seconds, 250000 Inserts)
% 6.41/6.67
% 6.41/6.67 That finishes the proof of the theorem.
% 6.41/6.67
% 6.41/6.67 Process 29638 finished Sat Jul 2 18:04:14 2022
%------------------------------------------------------------------------------