TSTP Solution File: LCL236-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL236-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:59 EDT 2022
% Result : Unsatisfiable 0.76s 0.99s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL236-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 21:39:16 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n021.cluster.edu,
% 0.14/0.37 Sun Jul 3 21:39:16 2022
% 0.14/0.37 The command was "./sos". The process ID is 18448.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.37 sos and nonpositive clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 2
% 0.21/0.41 number of clauses initially in problem: 13
% 0.21/0.41 percentage of clauses intially in UL: 15
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 33
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 9
% 0.21/0.41 distinct predicate count: 3
% 0.21/0.41 distinct function count: 4
% 0.21/0.41 distinct constant count: 2
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 0.76/0.99
% 0.76/0.99 -------- PROOF --------
% 0.76/0.99 % SZS status Unsatisfiable
% 0.76/0.99 % SZS output start Refutation
% 0.76/0.99
% 0.76/0.99 Model 3 (0.00 seconds, 0 Inserts)
% 0.76/0.99
% 0.76/0.99 Stopped by limit on number of solutions
% 0.76/0.99
% 0.76/0.99 Stopped by limit on insertions
% 0.76/0.99
% 0.76/0.99 Model 4 [ 1 1 542 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.99
% 0.76/0.99 Model 5 (0.00 seconds, 250000 Inserts)
% 0.76/0.99
% 0.76/0.99 Stopped by limit on number of solutions
% 0.76/0.99
% 0.76/0.99 Stopped by limit on insertions
% 0.76/0.99
% 0.76/0.99 Model 6 [ 3 1 3141 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.99
% 0.76/0.99 Stopped by limit on insertions
% 0.76/0.99
% 0.76/0.99 Model 7 [ 30 0 92 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.99
% 0.76/0.99 Stopped by limit on insertions
% 0.76/0.99
% 0.76/0.99 Model 8 [ 2 0 577 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.99
% 0.76/0.99 Stopped by limit on insertions
% 0.76/0.99
% 0.76/0.99 Model 9 [ 3 1 6525 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.99
% 0.76/0.99 ----> UNIT CONFLICT at 0.59 sec ----> 1263 [binary,1262.1,105.1] {-} $F.
% 0.76/0.99
% 0.76/0.99 Length of proof is 17. Level of proof is 7.
% 0.76/0.99
% 0.76/0.99 ---------------- PROOF ----------------
% 0.76/0.99 % SZS status Unsatisfiable
% 0.76/0.99 % SZS output start Refutation
% 0.76/0.99
% 0.76/0.99 1 [] {+} theorem(A)| -axiom(A).
% 0.76/0.99 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 0.76/0.99 3 [] {-} -theorem(implies(or(not(p),not(q)),not(and(p,q)))).
% 0.76/0.99 4 [] {+} axiom(implies(or(A,A),A)).
% 0.76/0.99 5 [] {+} axiom(implies(A,or(B,A))).
% 0.76/0.99 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 0.76/0.99 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 0.76/0.99 9 [] {-} implies(A,B)=or(not(A),B).
% 0.76/0.99 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 0.76/0.99 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 0.76/0.99 13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 0.76/0.99 16 [back_demod,3,demod,11] {-} -theorem(implies(implies(p,not(q)),not(and(p,q)))).
% 0.76/0.99 17 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 0.76/0.99 18 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 0.76/0.99 19 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 0.76/0.99 21 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 0.76/0.99 30 [para_into,17.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 0.76/0.99 37 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 0.76/0.99 38 [copy,37,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 0.76/0.99 50 [para_into,19.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 0.76/0.99 70 [para_into,21.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 0.76/0.99 105 [para_from,38.1.1,16.1.1] {-} -theorem(or(and(p,q),not(and(p,q)))).
% 0.76/0.99 113 [para_from,38.1.1,2.2.1] {-} theorem(A)| -theorem(or(and(B,C),A))| -theorem(implies(B,not(C))).
% 0.76/0.99 1079 [hyper,70,2,18] {+} theorem(or(A,implies(B,B))).
% 0.76/0.99 1123 [hyper,1079,113,30] {+} theorem(implies(A,A)).
% 0.76/0.99 1262 [hyper,1123,2,50] {-} theorem(or(A,not(A))).
% 0.76/0.99 1263 [binary,1262.1,105.1] {-} $F.
% 0.76/0.99
% 0.76/0.99 % SZS output end Refutation
% 0.76/0.99 ------------ end of proof -------------
% 0.76/0.99
% 0.76/0.99
% 0.76/0.99 Search stopped by max_proofs option.
% 0.76/0.99
% 0.76/0.99
% 0.76/0.99 Search stopped by max_proofs option.
% 0.76/0.99
% 0.76/0.99 ============ end of search ============
% 0.76/0.99
% 0.76/0.99 ----------- soft-scott stats ----------
% 0.76/0.99
% 0.76/0.99 true clauses given 42 (32.6%)
% 0.76/0.99 false clauses given 87
% 0.76/0.99
% 0.76/0.99 FALSE TRUE
% 0.76/0.99 6 0 2
% 0.76/0.99 8 0 7
% 0.76/0.99 9 0 14
% 0.76/0.99 10 0 38
% 0.76/0.99 11 7 9
% 0.76/0.99 12 10 29
% 0.76/0.99 13 80 7
% 0.76/0.99 14 46 29
% 0.76/0.99 15 105 2
% 0.76/0.99 16 80 32
% 0.76/0.99 17 90 0
% 0.76/0.99 18 115 22
% 0.76/0.99 19 76 0
% 0.76/0.99 20 75 8
% 0.76/0.99 21 38 0
% 0.76/0.99 22 31 4
% 0.76/0.99 23 3 0
% 0.76/0.99 24 26 4
% 0.76/0.99 25 2 0
% 0.76/0.99 26 27 4
% 0.76/0.99 28 24 2
% 0.76/0.99 30 3 2
% 0.76/0.99 32 3 0
% 0.76/0.99 tot: 841 215 (20.4% true)
% 0.76/0.99
% 0.76/0.99
% 0.76/0.99 Model 9 [ 3 1 6525 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.99
% 0.76/0.99 That finishes the proof of the theorem.
% 0.76/0.99
% 0.76/0.99 Process 18448 finished Sun Jul 3 21:39:16 2022
%------------------------------------------------------------------------------