%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL218-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:47 EDT 2022
% Result : Unsatisfiable 2.23s 2.39s
% Output : Refutation 2.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL218-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.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 : Mon Jul 4 02:47:39 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 n014.cluster.edu,
% 0.13/0.36 Mon Jul 4 02:47:39 2022
% 0.13/0.36 The command was "./sos". The process ID is 32528.
% 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 ===========
% 2.23/2.39
% 2.23/2.39 -------- PROOF --------
% 2.23/2.39 % SZS status Unsatisfiable
% 2.23/2.39 % SZS output start Refutation
% 2.23/2.39
% 2.23/2.39 Model 3 (0.00 seconds, 0 Inserts)
% 2.23/2.39
% 2.23/2.39 Stopped by limit on number of solutions
% 2.23/2.39
% 2.23/2.39 Stopped by limit on insertions
% 2.23/2.39
% 2.23/2.39 Model 4 [ 12 1 286 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.39
% 2.23/2.39 Stopped by limit on insertions
% 2.23/2.39
% 2.23/2.39 Model 5 [ 1 1 5717 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.39
% 2.23/2.39 Stopped by limit on insertions
% 2.23/2.39
% 2.23/2.39 Model 6 [ 1 9 95309 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.39
% 2.23/2.39 Stopped by limit on insertions
% 2.23/2.39
% 2.23/2.39 Model 7 [ 3 16 138102 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.39
% 2.23/2.39 Modelling stopped after 300 given clauses and 0.00 seconds
% 2.23/2.39
% 2.23/2.39
% 2.23/2.39 ----> UNIT CONFLICT at 2.00 sec ----> 3756 [binary,3755.1,4.1] {+} $F.
% 2.23/2.39
% 2.23/2.39 Length of proof is 6. Level of proof is 6.
% 2.23/2.39
% 2.23/2.39 ---------------- PROOF ----------------
% 2.23/2.39 % SZS status Unsatisfiable
% 2.23/2.39 % SZS output start Refutation
% 2.23/2.39
% 2.23/2.39 1 [] {+} theorem(A)| -axiom(A).
% 2.23/2.39 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 2.23/2.39 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 2.23/2.39 4 [] {+} -theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))).
% 2.23/2.39 6 [] {+} axiom(or(not(A),or(B,A))).
% 2.23/2.39 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 2.23/2.39 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 2.23/2.39 12 [hyper,7,1] {-} theorem(or(not(or(A,B)),or(B,A))).
% 2.23/2.39 26 [hyper,8,2,12] {+} theorem(or(A,or(not(or(B,A)),B))).
% 2.23/2.39 288 [hyper,26,3,7] {+} theorem(or(not(or(A,B)),or(not(or(C,not(or(B,A)))),C))).
% 2.23/2.39 3736 [hyper,288,3,6] {-} theorem(or(not(A),or(not(or(B,not(or(A,C)))),B))).
% 2.23/2.39 3752 [hyper,3736,2,8] {-} theorem(or(not(or(A,not(or(B,C)))),or(not(B),A))).
% 2.23/2.39 3755 [hyper,3752,3,7] {-} theorem(or(not(or(not(or(A,B)),C)),or(not(A),C))).
% 2.23/2.39 3756 [binary,3755.1,4.1] {+} $F.
% 2.23/2.39
% 2.23/2.39 % SZS output end Refutation
% 2.23/2.39 ------------ end of proof -------------
% 2.23/2.39
% 2.23/2.39
% 2.23/2.39 Search stopped by max_proofs option.
% 2.23/2.39
% 2.23/2.39
% 2.23/2.39 Search stopped by max_proofs option.
% 2.23/2.39
% 2.23/2.39 ============ end of search ============
% 2.23/2.39
% 2.23/2.39 ----------- soft-scott stats ----------
% 2.23/2.39
% 2.23/2.39 true clauses given 303 (33.7%)
% 2.23/2.39 false clauses given 596
% 2.23/2.39
% 2.23/2.39 FALSE TRUE
% 2.23/2.39 11 0 152
% 2.23/2.39 12 0 1
% 2.23/2.39 13 1 229
% 2.23/2.39 14 0 16
% 2.23/2.39 15 2 153
% 2.23/2.39 16 59 24
% 2.23/2.39 17 493 132
% 2.23/2.39 18 69 22
% 2.23/2.39 19 158 319
% 2.23/2.39 20 26 78
% 2.23/2.39 21 70 169
% 2.23/2.39 22 10 54
% 2.23/2.39 23 68 51
% 2.23/2.39 24 12 29
% 2.23/2.39 25 68 32
% 2.23/2.39 26 7 21
% 2.23/2.39 27 6 42
% 2.23/2.39 28 4 9
% 2.23/2.39 29 10 7
% 2.23/2.39 30 0 8
% 2.23/2.39 31 10 7
% 2.23/2.39 32 0 4
% 2.23/2.39 33 4 4
% 2.23/2.39 35 0 1
% 2.23/2.39 36 0 1
% 2.23/2.39 37 0 3
% 2.23/2.39 47 0 1
% 2.23/2.39 tot: 1077 1569 (59.3% true)
% 2.23/2.39
% 2.23/2.39
% 2.23/2.39 Model 7 [ 3 16 138102 ] (0.00 seconds, 250000 Inserts)
% 2.23/2.39
% 2.23/2.39 That finishes the proof of the theorem.
% 2.23/2.39
% 2.23/2.39 Process 32528 finished Mon Jul 4 02:47:41 2022
%------------------------------------------------------------------------------