%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL205-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:39 EDT 2022
% Result : Unsatisfiable 6.42s 6.67s
% Output : Refutation 6.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL205-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 2 16:05:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.36 Sat Jul 2 16:05:05 2022
% 0.13/0.36 The command was "./sos". The process ID is 11395.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 4
% 0.13/0.40 number of clauses initially in problem: 9
% 0.13/0.40 percentage of clauses intially in UL: 44
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 6
% 0.13/0.40 distinct predicate count: 2
% 0.13/0.40 distinct function count: 2
% 0.13/0.40 distinct constant count: 2
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 6.42/6.67
% 6.42/6.67 -------- PROOF --------
% 6.42/6.67 % SZS status Unsatisfiable
% 6.42/6.67 % SZS output start Refutation
% 6.42/6.67
% 6.42/6.67 Model 3 (0.00 seconds, 0 Inserts)
% 6.42/6.67
% 6.42/6.67 Stopped by limit on number of solutions
% 6.42/6.67
% 6.42/6.67 Model 4 (0.00 seconds, 0 Inserts)
% 6.42/6.67
% 6.42/6.67 Stopped by limit on number of solutions
% 6.42/6.67
% 6.42/6.67 Stopped by limit on insertions
% 6.42/6.67
% 6.42/6.67 Model 5 [ 1 8 44688 ] (0.00 seconds, 250000 Inserts)
% 6.42/6.67
% 6.42/6.67 Stopped by limit on insertions
% 6.42/6.67
% 6.42/6.67 Model 6 [ 1 1 169 ] (0.00 seconds, 250000 Inserts)
% 6.42/6.67
% 6.42/6.67 Stopped by limit on insertions
% 6.42/6.67
% 6.42/6.67 Model 7 [ 2 6 25508 ] (0.00 seconds, 250000 Inserts)
% 6.42/6.67
% 6.42/6.67 Stopped by limit on insertions
% 6.42/6.67
% 6.42/6.67 Model 8 [ 2 27 170923 ] (0.00 seconds, 250000 Inserts)
% 6.42/6.67
% 6.42/6.67 Stopped by limit on insertions
% 6.42/6.67
% 6.42/6.67 Stopped by limit on insertions
% 6.42/6.67
% 6.42/6.67 Model 9 [ 3 27 115642 ] (0.00 seconds, 250000 Inserts)
% 6.42/6.67
% 6.42/6.67 ----> UNIT CONFLICT at 6.28 sec ----> 203 [binary,202.1,4.1] {-} $F.
% 6.42/6.67
% 6.42/6.67 Length of proof is 7. Level of proof is 7.
% 6.42/6.67
% 6.42/6.67 ---------------- PROOF ----------------
% 6.42/6.67 % SZS status Unsatisfiable
% 6.42/6.67 % SZS output start Refutation
% 6.42/6.67
% 6.42/6.67 1 [] {+} theorem(A)| -axiom(A).
% 6.42/6.67 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 6.42/6.67 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 6.42/6.67 4 [] {+} -theorem(or(not(not(or(not(p),q))),or(not(p),not(q)))).
% 6.42/6.67 5 [] {+} axiom(or(not(or(A,A)),A)).
% 6.42/6.67 6 [] {+} axiom(or(not(A),or(B,A))).
% 6.42/6.67 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 6.42/6.67 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 6.42/6.67 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 6.42/6.67 30 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 6.42/6.67 36 [hyper,30,2,7] {+} theorem(or(A,not(A))).
% 6.42/6.67 56 [hyper,36,3,6] {-} theorem(or(not(A),not(not(or(B,A))))).
% 6.42/6.67 98 [hyper,56,2,7] {-} theorem(or(not(not(or(A,B))),not(B))).
% 6.42/6.67 108 [hyper,98,2,6] {-} theorem(or(A,or(not(not(or(B,C))),not(C)))).
% 6.42/6.67 202 [hyper,108,2,8] {-} theorem(or(not(not(or(A,B))),or(C,not(B)))).
% 6.42/6.67 203 [binary,202.1,4.1] {-} $F.
% 6.42/6.67
% 6.42/6.67 % SZS output end Refutation
% 6.42/6.67 ------------ end of proof -------------
% 6.42/6.67
% 6.42/6.67
% 6.42/6.67 Search stopped by max_proofs option.
% 6.42/6.67
% 6.42/6.67
% 6.42/6.67 Search stopped by max_proofs option.
% 6.42/6.67
% 6.42/6.67 ============ end of search ============
% 6.42/6.67
% 6.42/6.67 ----------- soft-scott stats ----------
% 6.42/6.67
% 6.42/6.67 true clauses given 12 (30.8%)
% 6.42/6.67 false clauses given 27
% 6.42/6.67
% 6.42/6.67 FALSE TRUE
% 6.42/6.67 7 0 2
% 6.42/6.67 9 0 21
% 6.42/6.67 11 13 18
% 6.42/6.67 12 0 1
% 6.42/6.67 13 21 16
% 6.42/6.67 14 4 0
% 6.42/6.67 15 16 9
% 6.42/6.67 16 1 0
% 6.42/6.67 17 11 2
% 6.42/6.67 19 8 1
% 6.42/6.67 21 4 1
% 6.42/6.67 22 1 0
% 6.42/6.67 27 1 0
% 6.42/6.67 tot: 80 71 (47.0% true)
% 6.42/6.67
% 6.42/6.67
% 6.42/6.67 Model 9 [ 3 27 115642 ] (0.00 seconds, 250000 Inserts)
% 6.42/6.67
% 6.42/6.67 That finishes the proof of the theorem.
% 6.42/6.67
% 6.42/6.67 Process 11395 finished Sat Jul 2 16:05:11 2022
%------------------------------------------------------------------------------