%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL212-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:43 EDT 2022
% Result : Unsatisfiable 11.70s 11.93s
% Output : Refutation 11.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL212-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n019.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 10:52:23 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 sandbox on n019.cluster.edu,
% 0.13/0.36 Sat Jul 2 10:52:23 2022
% 0.13/0.36 The command was "./sos". The process ID is 3977.
% 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.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 4
% 0.19/0.40 number of clauses initially in problem: 9
% 0.19/0.40 percentage of clauses intially in UL: 44
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 6
% 0.19/0.40 distinct predicate count: 2
% 0.19/0.40 distinct function count: 2
% 0.19/0.40 distinct constant count: 2
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 11.70/11.93
% 11.70/11.93 -- HEY sandbox, WE HAVE A PROOF!! --
% 11.70/11.93
% 11.70/11.93 Model 3 (0.00 seconds, 0 Inserts)
% 11.70/11.93
% 11.70/11.93 Stopped by limit on number of solutions
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Model 4 [ 1 2 7210 ] (0.00 seconds, 250000 Inserts)
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Model 5 [ 3 23 170791 ] (0.00 seconds, 250000 Inserts)
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Model 6 [ 2 1 1336 ] (0.00 seconds, 250000 Inserts)
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Model 7 [ 2 8 33286 ] (0.00 seconds, 250000 Inserts)
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Stopped by limit on insertions
% 11.70/11.93
% 11.70/11.93 Model 8 [ 2 0 612 ] (0.00 seconds, 250000 Inserts)
% 11.70/11.93
% 11.70/11.93 ----> UNIT CONFLICT at 11.54 sec ----> 2015 [binary,2014.1,4.1] {-} $F.
% 11.70/11.93
% 11.70/11.93 Length of proof is 6. Level of proof is 6.
% 11.70/11.93
% 11.70/11.93 ---------------- PROOF ----------------
% 11.70/11.93 % SZS status Unsatisfiable
% 11.70/11.93 % SZS output start Refutation
% 11.70/11.93
% 11.70/11.93 1 [] {+} theorem(A)| -axiom(A).
% 11.70/11.93 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 11.70/11.93 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 11.70/11.93 4 [] {+} -theorem(or(not(or(not(not(p)),q)),or(not(or(not(p),q)),q))).
% 11.70/11.93 5 [] {+} axiom(or(not(or(A,A)),A)).
% 11.70/11.93 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 11.70/11.93 8 [] {+} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 11.70/11.93 9 [] {+} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 11.70/11.93 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 11.70/11.93 49 [hyper,9,2,10] {-} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 11.70/11.93 142 [hyper,49,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 11.70/11.93 672 [hyper,142,2,8] {-} theorem(or(not(or(A,B)),or(not(or(not(B),A)),A))).
% 11.70/11.93 1364 [hyper,672,3,7] {-} theorem(or(not(or(A,B)),or(not(or(not(A),B)),B))).
% 11.70/11.93 2014 [hyper,1364,2,8] {-} theorem(or(not(or(not(A),B)),or(not(or(A,B)),B))).
% 11.70/11.93 2015 [binary,2014.1,4.1] {-} $F.
% 11.70/11.93
% 11.70/11.93 % SZS output end Refutation
% 11.70/11.93 ------------ end of proof -------------
% 11.70/11.93
% 11.70/11.93
% 11.70/11.93 Search stopped by max_proofs option.
% 11.70/11.93
% 11.70/11.93
% 11.70/11.93 Search stopped by max_proofs option.
% 11.70/11.93
% 11.70/11.93 ============ end of search ============
% 11.70/11.93
% 11.70/11.93 ----------- soft-scott stats ----------
% 11.70/11.93
% 11.70/11.93 true clauses given 132 (32.4%)
% 11.70/11.93 false clauses given 275
% 11.70/11.93
% 11.70/11.93 FALSE TRUE
% 11.70/11.93 11 0 131
% 11.70/11.93 13 50 207
% 11.70/11.93 14 8 3
% 11.70/11.93 15 266 70
% 11.70/11.93 16 10 6
% 11.70/11.93 17 197 62
% 11.70/11.93 18 32 3
% 11.70/11.93 19 116 48
% 11.70/11.93 20 30 4
% 11.70/11.93 21 56 33
% 11.70/11.93 22 19 3
% 11.70/11.93 23 40 14
% 11.70/11.93 24 1 7
% 11.70/11.93 25 24 0
% 11.70/11.93 26 6 2
% 11.70/11.93 27 4 1
% 11.70/11.93 28 12 0
% 11.70/11.93 29 1 5
% 11.70/11.93 30 1 0
% 11.70/11.93 31 3 2
% 11.70/11.93 32 1 0
% 11.70/11.93 33 10 1
% 11.70/11.93 34 1 0
% 11.70/11.93 35 1 1
% 11.70/11.93 36 1 2
% 11.70/11.93 37 2 2
% 11.70/11.93 46 1 0
% 11.70/11.93 47 0 2
% 11.70/11.93 57 1 0
% 11.70/11.93 tot: 894 609 (40.5% true)
% 11.70/11.93
% 11.70/11.93
% 11.70/11.93 Model 8 [ 2 0 612 ] (0.00 seconds, 250000 Inserts)
% 11.70/11.93
% 11.70/11.93 That finishes the proof of the theorem.
% 11.70/11.93
% 11.70/11.93 Process 3977 finished Sat Jul 2 10:52:35 2022
%------------------------------------------------------------------------------