TSTP Solution File: LCL180-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL180-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:23 EDT 2022
% Result : Unsatisfiable 2.19s 2.37s
% Output : Refutation 2.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL180-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 00:28:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n008.cluster.edu,
% 0.12/0.36 Mon Jul 4 00:28:38 2022
% 0.12/0.36 The command was "./sos". The process ID is 15517.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36 sos and nonpositive clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/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: 3
% 0.19/0.40 number of clauses initially in problem: 11
% 0.19/0.40 percentage of clauses intially in UL: 27
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 71
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 7
% 0.19/0.40 distinct predicate count: 3
% 0.19/0.40 distinct function count: 3
% 0.19/0.40 distinct constant count: 1
% 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 ===========
% 2.19/2.37
% 2.19/2.37 -------- PROOF --------
% 2.19/2.37 % SZS status Unsatisfiable
% 2.19/2.37 % SZS output start Refutation
% 2.19/2.37
% 2.19/2.37 Model 3 (0.00 seconds, 0 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on number of solutions
% 2.19/2.37
% 2.19/2.37 Model 4 (0.00 seconds, 0 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on number of solutions
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Model 5 [ 1 1 3258 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Model 6 [ 21 3 49680 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Model 7 [ 22 3 44119 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Model 8 [ 22 3 55557 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Model 9 [ 1 1 423 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Model 10 [ 31 3 32350 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.37
% 2.19/2.37 Stopped by limit on insertions
% 2.19/2.37
% 2.19/2.37 Model 11 [ 32 2 17298 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.37
% 2.19/2.37 Model 12 [ 1 0 362 ] (0.00 seconds, 91494 Inserts)
% 2.19/2.37
% 2.19/2.37 ----> UNIT CONFLICT at 1.98 sec ----> 1068 [binary,1067.1,3.1] {-} $F.
% 2.19/2.37
% 2.19/2.37 Length of proof is 30. Level of proof is 16.
% 2.19/2.37
% 2.19/2.37 ---------------- PROOF ----------------
% 2.19/2.37 % SZS status Unsatisfiable
% 2.19/2.37 % SZS output start Refutation
% 2.19/2.37
% 2.19/2.37 1 [] {+} theorem(A)| -axiom(A).
% 2.19/2.37 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 2.19/2.37 3 [] {+} -theorem(implies(not(not(p)),p)).
% 2.19/2.37 4 [] {+} axiom(implies(or(A,A),A)).
% 2.19/2.37 5 [] {+} axiom(implies(A,or(B,A))).
% 2.19/2.37 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 2.19/2.37 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.19/2.37 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.19/2.37 9 [] {-} implies(A,B)=or(not(A),B).
% 2.19/2.37 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 2.19/2.37 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 2.19/2.37 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 2.19/2.37 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 2.19/2.37 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.19/2.37 23 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 2.19/2.37 24 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 2.19/2.37 29 [para_into,14.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 2.19/2.37 30 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.19/2.37 51 [para_into,20.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 2.19/2.37 88 [hyper,23,2,29] {+} theorem(or(implies(A,B),not(B))).
% 2.19/2.37 95 [hyper,88,2,14] {-} theorem(or(A,or(implies(B,C),not(C)))).
% 2.19/2.37 124 [hyper,30,2,24] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 2.19/2.37 135 [para_into,124.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 2.19/2.37 141 [hyper,135,2,14] {-} theorem(implies(not(A),implies(A,B))).
% 2.19/2.37 146 [hyper,141,2,23] {-} theorem(or(implies(A,B),not(not(A)))).
% 2.19/2.37 149 [hyper,146,2,14] {-} theorem(or(A,or(implies(B,C),not(not(B))))).
% 2.19/2.37 173 [hyper,149,2,20] {-} theorem(or(implies(A,B),or(C,not(not(A))))).
% 2.19/2.37 176 [hyper,173,2,124] {-} theorem(or(implies(A,B),implies(not(A),C))).
% 2.19/2.37 184 [hyper,176,2,15] {-} theorem(or(implies(not(A),B),implies(A,C))).
% 2.19/2.37 335 [hyper,95,2,20] {-} theorem(or(implies(A,B),or(C,not(B)))).
% 2.19/2.37 380 [hyper,335,2,124] {+} theorem(or(implies(A,B),implies(B,C))).
% 2.19/2.37 391 [hyper,380,2,13] {+} theorem(implies(A,A)).
% 2.19/2.37 400 [hyper,391,2,23] {+} theorem(or(A,not(A))).
% 2.19/2.37 407 [hyper,51,2,184] {-} theorem(implies(A,or(implies(not(A),B),C))).
% 2.19/2.37 423 [hyper,407,2,30] {-} theorem(implies(or(A,B),or(A,or(implies(not(B),C),D)))).
% 2.19/2.37 786 [hyper,423,2,400] {-} theorem(or(A,or(implies(not(not(A)),B),C))).
% 2.19/2.37 832 [hyper,786,2,20] {-} theorem(or(implies(not(not(A)),B),or(A,C))).
% 2.19/2.37 856 [hyper,832,2,124] {-} theorem(or(implies(not(not(A)),B),implies(C,A))).
% 2.19/2.37 1067 [hyper,856,2,13] {-} theorem(implies(not(not(A)),A)).
% 2.19/2.37 1068 [binary,1067.1,3.1] {-} $F.
% 2.19/2.37
% 2.19/2.37 % SZS output end Refutation
% 2.19/2.37 ------------ end of proof -------------
% 2.19/2.37
% 2.19/2.37
% 2.19/2.37 Search stopped by max_proofs option.
% 2.19/2.37
% 2.19/2.37
% 2.19/2.37 Search stopped by max_proofs option.
% 2.19/2.37
% 2.19/2.37 ============ end of search ============
% 2.19/2.37
% 2.19/2.37 ----------- soft-scott stats ----------
% 2.19/2.37
% 2.19/2.37 true clauses given 44 (34.4%)
% 2.19/2.37 false clauses given 84
% 2.19/2.37
% 2.19/2.37 FALSE TRUE
% 2.19/2.37 7 0 6
% 2.19/2.37 8 0 45
% 2.19/2.37 9 0 23
% 2.19/2.37 10 12 67
% 2.19/2.37 11 2 105
% 2.19/2.37 12 25 79
% 2.19/2.37 13 35 75
% 2.19/2.37 14 12 77
% 2.19/2.37 15 49 57
% 2.19/2.37 16 5 67
% 2.19/2.37 17 3 15
% 2.19/2.37 18 0 43
% 2.19/2.37 19 0 20
% 2.19/2.37 20 0 19
% 2.19/2.37 22 0 18
% 2.19/2.37 24 0 12
% 2.19/2.37 26 0 7
% 2.19/2.37 28 0 12
% 2.19/2.37 30 0 8
% 2.19/2.37 tot: 143 755 (84.1% true)
% 2.19/2.37
% 2.19/2.37
% 2.19/2.37 Model 12 [ 1 0 362 ] (0.00 seconds, 91494 Inserts)
% 2.19/2.37
% 2.19/2.37 That finishes the proof of the theorem.
% 2.19/2.37
% 2.19/2.37 Process 15517 finished Mon Jul 4 00:28:40 2022
%------------------------------------------------------------------------------