TSTP Solution File: LCL187-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL187-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:28 EDT 2022
% Result : Unsatisfiable 1.82s 2.05s
% Output : Refutation 1.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL187-3 : TPTP v8.1.0. Released v2.3.0.
% 0.13/0.14 % Command : sos-script %s
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jul 4 10:33:51 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.37 ----- Otter 3.2, August 2001 -----
% 0.15/0.37 The process was started by sandbox on n011.cluster.edu,
% 0.15/0.37 Mon Jul 4 10:33:51 2022
% 0.15/0.37 The command was "./sos". The process ID is 26079.
% 0.15/0.37
% 0.15/0.37 set(prolog_style_variables).
% 0.15/0.37 set(auto).
% 0.15/0.37 dependent: set(auto1).
% 0.15/0.37 dependent: set(process_input).
% 0.15/0.37 dependent: clear(print_kept).
% 0.15/0.37 dependent: clear(print_new_demod).
% 0.15/0.37 dependent: clear(print_back_demod).
% 0.15/0.37 dependent: clear(print_back_sub).
% 0.15/0.37 dependent: set(control_memory).
% 0.15/0.37 dependent: assign(max_mem, 12000).
% 0.15/0.37 dependent: assign(pick_given_ratio, 4).
% 0.15/0.37 dependent: assign(stats_level, 1).
% 0.15/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.37 dependent: assign(sos_limit, 5000).
% 0.15/0.37 dependent: assign(max_weight, 60).
% 0.15/0.37 clear(print_given).
% 0.15/0.37
% 0.15/0.37 list(usable).
% 0.15/0.37
% 0.15/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.15/0.37
% 0.15/0.37 This is a Horn set with equality. The strategy will be
% 0.15/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.15/0.37 sos and nonpositive clauses in usable.
% 0.15/0.37
% 0.15/0.37 dependent: set(knuth_bendix).
% 0.15/0.37 dependent: set(para_from).
% 0.15/0.37 dependent: set(para_into).
% 0.15/0.37 dependent: clear(para_from_right).
% 0.15/0.37 dependent: clear(para_into_right).
% 0.15/0.37 dependent: set(para_from_vars).
% 0.15/0.37 dependent: set(eq_units_both_ways).
% 0.15/0.37 dependent: set(dynamic_demod_all).
% 0.15/0.37 dependent: set(dynamic_demod).
% 0.15/0.37 dependent: set(order_eq).
% 0.15/0.37 dependent: set(back_demod).
% 0.15/0.37 dependent: set(lrpo).
% 0.15/0.37 dependent: set(hyper_res).
% 0.15/0.37 dependent: clear(order_hyper).
% 0.15/0.37
% 0.15/0.37 ------------> process usable:
% 0.15/0.37
% 0.15/0.37 ------------> process sos:
% 0.15/0.37 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.15/0.37
% 0.15/0.37 ======= end of input processing =======
% 0.15/0.41
% 0.15/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.41
% 0.15/0.41 Stopped by limit on number of solutions
% 0.15/0.41
% 0.15/0.41
% 0.15/0.41 -------------- Softie stats --------------
% 0.15/0.41
% 0.15/0.41 UPDATE_STOP: 300
% 0.15/0.41 SFINDER_TIME_LIMIT: 2
% 0.15/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.41 number of clauses in intial UL: 3
% 0.15/0.41 number of clauses initially in problem: 11
% 0.15/0.41 percentage of clauses intially in UL: 27
% 0.15/0.41 percentage of distinct symbols occuring in initial UL: 75
% 0.15/0.41 percent of all initial clauses that are short: 100
% 0.15/0.41 absolute distinct symbol count: 8
% 0.15/0.41 distinct predicate count: 3
% 0.15/0.41 distinct function count: 3
% 0.15/0.41 distinct constant count: 2
% 0.15/0.41
% 0.15/0.41 ---------- no more Softie stats ----------
% 0.15/0.41
% 0.15/0.41
% 0.15/0.41
% 0.15/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.41
% 0.15/0.41 Stopped by limit on number of solutions
% 0.15/0.41
% 0.15/0.41 =========== start of search ===========
% 1.82/2.05
% 1.82/2.05 -------- PROOF --------
% 1.82/2.05 % SZS status Unsatisfiable
% 1.82/2.05 % SZS output start Refutation
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Model 3 [ 12 0 154 ] (0.00 seconds, 250000 Inserts)
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Model 4 [ 1 1 1648 ] (0.00 seconds, 250000 Inserts)
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Model 5 [ 1 2 21656 ] (0.00 seconds, 250000 Inserts)
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Model 6 [ 21 9 119245 ] (0.00 seconds, 250000 Inserts)
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Model 7 [ 1 20 226029 ] (0.00 seconds, 250000 Inserts)
% 1.82/2.05
% 1.82/2.05 Stopped by limit on insertions
% 1.82/2.05
% 1.82/2.05 Model 8 [ 2 0 113 ] (0.00 seconds, 250000 Inserts)
% 1.82/2.05
% 1.82/2.05 ----> UNIT CONFLICT at 1.65 sec ----> 1024 [binary,1023.1,3.1] {-} $F.
% 1.82/2.05
% 1.82/2.05 Length of proof is 17. Level of proof is 9.
% 1.82/2.05
% 1.82/2.05 ---------------- PROOF ----------------
% 1.82/2.05 % SZS status Unsatisfiable
% 1.82/2.05 % SZS output start Refutation
% 1.82/2.05
% 1.82/2.05 1 [] {+} theorem(A)| -axiom(A).
% 1.82/2.05 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 1.82/2.05 3 [] {+} -theorem(implies(p,implies(not(p),q))).
% 1.82/2.05 4 [] {+} axiom(implies(or(A,A),A)).
% 1.82/2.05 5 [] {-} axiom(implies(A,or(B,A))).
% 1.82/2.05 6 [] {-} axiom(implies(or(A,B),or(B,A))).
% 1.82/2.05 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.82/2.05 9 [] {-} implies(A,B)=or(not(A),B).
% 1.82/2.05 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 1.82/2.05 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 1.82/2.05 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 1.82/2.05 16 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 1.82/2.05 26 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 1.82/2.05 27 [para_into,16.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 1.82/2.05 31 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.82/2.05 171 [hyper,31,2,27] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 1.82/2.05 177 [hyper,31,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 1.82/2.05 468 [para_into,171.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 1.82/2.05 560 [hyper,468,2,14] {+} theorem(implies(not(A),implies(A,B))).
% 1.82/2.05 567 [hyper,560,2,31] {-} theorem(implies(or(A,not(B)),or(A,implies(B,C)))).
% 1.82/2.05 568 [hyper,560,2,26] {+} theorem(or(implies(A,B),not(not(A)))).
% 1.82/2.05 642 [hyper,177,2,468,demod,11] {-} theorem(implies(or(A,implies(B,not(B))),implies(B,A))).
% 1.82/2.05 982 [hyper,567,2,568] {-} theorem(or(implies(A,B),implies(not(A),C))).
% 1.82/2.05 996 [hyper,982,2,16] {-} theorem(or(implies(not(A),B),implies(A,C))).
% 1.82/2.05 1023 [hyper,642,2,996] {-} theorem(implies(A,implies(not(A),B))).
% 1.82/2.05 1024 [binary,1023.1,3.1] {-} $F.
% 1.82/2.05
% 1.82/2.05 % SZS output end Refutation
% 1.82/2.05 ------------ end of proof -------------
% 1.82/2.05
% 1.82/2.05
% 1.82/2.05 Search stopped by max_proofs option.
% 1.82/2.05
% 1.82/2.05
% 1.82/2.05 Search stopped by max_proofs option.
% 1.82/2.05
% 1.82/2.05 ============ end of search ============
% 1.82/2.05
% 1.82/2.05 ----------- soft-scott stats ----------
% 1.82/2.05
% 1.82/2.05 true clauses given 46 (32.2%)
% 1.82/2.05 false clauses given 97
% 1.82/2.05
% 1.82/2.05 FALSE TRUE
% 1.82/2.05 6 0 3
% 1.82/2.05 7 0 3
% 1.82/2.05 8 0 16
% 1.82/2.05 9 0 10
% 1.82/2.05 10 0 38
% 1.82/2.05 11 22 33
% 1.82/2.05 12 5 70
% 1.82/2.05 13 12 14
% 1.82/2.05 14 23 75
% 1.82/2.05 15 42 19
% 1.82/2.05 16 4 32
% 1.82/2.05 17 9 4
% 1.82/2.05 18 2 23
% 1.82/2.05 19 8 0
% 1.82/2.05 20 7 28
% 1.82/2.05 21 3 2
% 1.82/2.05 22 4 36
% 1.82/2.05 23 5 1
% 1.82/2.05 24 20 34
% 1.82/2.05 25 5 0
% 1.82/2.05 26 13 59
% 1.82/2.05 27 1 0
% 1.82/2.05 28 15 8
% 1.82/2.05 30 10 43
% 1.82/2.05 32 22 10
% 1.82/2.05 34 0 10
% 1.82/2.05 38 0 3
% 1.82/2.05 42 1 6
% 1.82/2.05 46 3 2
% 1.82/2.05 50 2 4
% 1.82/2.05 54 0 1
% 1.82/2.05 58 0 2
% 1.82/2.05 tot: 238 589 (71.2% true)
% 1.82/2.05
% 1.82/2.05
% 1.82/2.05 Model 8 [ 2 0 113 ] (0.00 seconds, 250000 Inserts)
% 1.82/2.05
% 1.82/2.05 That finishes the proof of the theorem.
% 1.82/2.05
% 1.82/2.05 Process 26079 finished Mon Jul 4 10:33:53 2022
%------------------------------------------------------------------------------