TSTP Solution File: LCL197-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL197-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:34 EDT 2022
% Result : Unsatisfiable 11.07s 11.25s
% Output : Refutation 11.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL197-3 : TPTP v8.1.0. Released v2.3.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n012.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 22:04:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n012.cluster.edu,
% 0.13/0.35 Sat Jul 2 22:04:47 2022
% 0.13/0.35 The command was "./sos". The process ID is 25681.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35 sos and nonpositive clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 3
% 0.13/0.39 number of clauses initially in problem: 11
% 0.13/0.39 percentage of clauses intially in UL: 27
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 8
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 3
% 0.13/0.39 distinct constant count: 2
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 11.07/11.25
% 11.07/11.25 -- HEY sandbox, WE HAVE A PROOF!! --
% 11.07/11.25
% 11.07/11.25 Model 3 (0.00 seconds, 0 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on number of solutions
% 11.07/11.25
% 11.07/11.25 Model 4 (0.00 seconds, 0 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on number of solutions
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 5 [ 1 2 7147 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 6 [ 1 0 625 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 7 [ 25 8 155794 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 8 [ 1 0 698 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 9 [ 1 0 226 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 10 [ 30 11 197955 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 11 [ 1 10 97984 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 12 [ 2 1 2487 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 13 [ 3 5 37641 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 14 [ 32 26 184845 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 15 [ 32 4 15951 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 16 [ 4 17 78088 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 17 [ 3 3 7100 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 18 [ 5 3 8098 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 19 [ 6 2 2141 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 Stopped by limit on insertions
% 11.07/11.25
% 11.07/11.25 Model 20 [ 4 64 106461 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 ----> UNIT CONFLICT at 10.86 sec ----> 2738 [binary,2737.1,3.1] {-} $F.
% 11.07/11.25
% 11.07/11.25 Length of proof is 18. Level of proof is 10.
% 11.07/11.25
% 11.07/11.25 ---------------- PROOF ----------------
% 11.07/11.25 % SZS status Unsatisfiable
% 11.07/11.25 % SZS output start Refutation
% 11.07/11.25
% 11.07/11.25 1 [] {+} theorem(A)| -axiom(A).
% 11.07/11.25 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 11.07/11.25 3 [] {+} -theorem(implies(or(q,or(p,q)),or(p,q))).
% 11.07/11.25 4 [] {+} axiom(implies(or(A,A),A)).
% 11.07/11.25 5 [] {+} axiom(implies(A,or(B,A))).
% 11.07/11.25 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 11.07/11.25 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 11.07/11.25 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 11.07/11.25 9 [] {-} implies(A,B)=or(not(A),B).
% 11.07/11.25 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 11.07/11.25 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 11.07/11.25 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 11.07/11.25 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 11.07/11.25 20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 11.07/11.25 29 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 11.07/11.25 54 [para_into,20.1.1.1.2,10.1.1,demod,11] {-} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 11.07/11.25 55 [para_into,20.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 11.07/11.25 72 [hyper,29,2,14] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 11.07/11.25 73 [hyper,29,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 11.07/11.25 90 [para_into,73.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,B)),implies(A,B))).
% 11.07/11.25 101 [hyper,90,2,14] {+} theorem(implies(A,A)).
% 11.07/11.25 888 [hyper,55,2,101] {+} theorem(or(A,implies(or(A,B),B))).
% 11.07/11.25 1107 [hyper,888,2,15] {+} theorem(or(implies(or(A,B),B),A)).
% 11.07/11.25 1118 [hyper,1107,2,72] {-} theorem(or(implies(or(A,B),B),or(C,A))).
% 11.07/11.25 2069 [hyper,1118,2,15] {-} theorem(or(or(A,B),implies(or(B,C),C))).
% 11.07/11.25 2405 [hyper,2069,2,54] {-} theorem(implies(or(A,B),or(or(C,A),B))).
% 11.07/11.25 2737 [hyper,2405,2,90] {-} theorem(implies(or(A,or(B,A)),or(B,A))).
% 11.07/11.25 2738 [binary,2737.1,3.1] {-} $F.
% 11.07/11.25
% 11.07/11.25 % SZS output end Refutation
% 11.07/11.25 ------------ end of proof -------------
% 11.07/11.25
% 11.07/11.25
% 11.07/11.25 Search stopped by max_proofs option.
% 11.07/11.25
% 11.07/11.25
% 11.07/11.25 Search stopped by max_proofs option.
% 11.07/11.25
% 11.07/11.25 ============ end of search ============
% 11.07/11.25
% 11.07/11.25 ----------- soft-scott stats ----------
% 11.07/11.25
% 11.07/11.25 true clauses given 60 (29.4%)
% 11.07/11.25 false clauses given 144
% 11.07/11.25
% 11.07/11.25 FALSE TRUE
% 11.07/11.25 8 0 46
% 11.07/11.25 9 0 106
% 11.07/11.25 10 4 187
% 11.07/11.25 11 37 136
% 11.07/11.25 12 367 171
% 11.07/11.25 13 296 38
% 11.07/11.25 14 234 85
% 11.07/11.25 15 219 17
% 11.07/11.25 16 102 46
% 11.07/11.25 17 104 4
% 11.07/11.25 18 68 39
% 11.07/11.25 19 30 1
% 11.07/11.25 20 22 1
% 11.07/11.25 21 8 0
% 11.07/11.25 22 53 12
% 11.07/11.25 23 2 0
% 11.07/11.25 24 27 0
% 11.07/11.25 26 8 7
% 11.07/11.25 28 7 0
% 11.07/11.25 30 4 2
% 11.07/11.25 34 2 0
% 11.07/11.25 tot: 1594 898 (36.0% true)
% 11.07/11.25
% 11.07/11.25
% 11.07/11.25 Model 20 [ 4 64 106461 ] (0.00 seconds, 250000 Inserts)
% 11.07/11.25
% 11.07/11.25 That finishes the proof of the theorem.
% 11.07/11.25
% 11.07/11.25 Process 25681 finished Sat Jul 2 22:04:57 2022
%------------------------------------------------------------------------------