TSTP Solution File: LCL258-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL258-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:29:11 EDT 2022
% Result : Unsatisfiable 5.54s 5.75s
% Output : Refutation 5.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL258-3 : TPTP v8.1.0. Released v2.3.0.
% 0.13/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n026.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 4 08:32:21 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n026.cluster.edu,
% 0.14/0.38 Mon Jul 4 08:32:22 2022
% 0.14/0.38 The command was "./sos". The process ID is 4970.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.38
% 0.14/0.38 This is a Horn set with equality. The strategy will be
% 0.14/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.38 sos and nonpositive clauses in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(knuth_bendix).
% 0.14/0.38 dependent: set(para_from).
% 0.14/0.38 dependent: set(para_into).
% 0.14/0.38 dependent: clear(para_from_right).
% 0.14/0.38 dependent: clear(para_into_right).
% 0.14/0.38 dependent: set(para_from_vars).
% 0.14/0.38 dependent: set(eq_units_both_ways).
% 0.14/0.38 dependent: set(dynamic_demod_all).
% 0.14/0.38 dependent: set(dynamic_demod).
% 0.14/0.38 dependent: set(order_eq).
% 0.14/0.38 dependent: set(back_demod).
% 0.14/0.38 dependent: set(lrpo).
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: clear(order_hyper).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.14/0.41
% 0.14/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.41
% 0.14/0.41 Stopped by limit on number of solutions
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 -------------- Softie stats --------------
% 0.14/0.41
% 0.14/0.41 UPDATE_STOP: 300
% 0.14/0.41 SFINDER_TIME_LIMIT: 2
% 0.14/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.41 number of clauses in intial UL: 3
% 0.14/0.41 number of clauses initially in problem: 11
% 0.14/0.41 percentage of clauses intially in UL: 27
% 0.14/0.41 percentage of distinct symbols occuring in initial UL: 62
% 0.14/0.41 percent of all initial clauses that are short: 100
% 0.14/0.41 absolute distinct symbol count: 8
% 0.14/0.41 distinct predicate count: 3
% 0.14/0.41 distinct function count: 3
% 0.14/0.41 distinct constant count: 2
% 0.14/0.41
% 0.14/0.41 ---------- no more Softie stats ----------
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41
% 0.14/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.41
% 0.14/0.41 Stopped by limit on number of solutions
% 0.14/0.41
% 0.14/0.41 =========== start of search ===========
% 5.54/5.75
% 5.54/5.75 -------- PROOF --------
% 5.54/5.75 % SZS status Unsatisfiable
% 5.54/5.75 % SZS output start Refutation
% 5.54/5.75
% 5.54/5.75 Model 3 (0.00 seconds, 0 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on number of solutions
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 4 [ 2 1 102 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 5 [ 21 0 155 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 6 [ 21 7 143044 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Model 7 [ 1 3 26073 ] (0.00 seconds, 145959 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 8 [ 1 1 14700 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Model 9 [ 1 1 493 ] (0.00 seconds, 127995 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 10 [ 1 1 108 ] (0.00 seconds, 88914 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 11 [ 1 2 23376 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 12 [ 1 3 21795 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 13 [ 1 1 80 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 14 [ 3 0 696 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 15 [ 19 30 164853 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 16 [ 2 1 173 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Stopped by limit on insertions
% 5.54/5.75
% 5.54/5.75 Model 17 [ 43 5 19523 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 ----> UNIT CONFLICT at 5.34 sec ----> 631 [binary,630.1,3.1] {+} $F.
% 5.54/5.75
% 5.54/5.75 Length of proof is 9. Level of proof is 6.
% 5.54/5.75
% 5.54/5.75 ---------------- PROOF ----------------
% 5.54/5.75 % SZS status Unsatisfiable
% 5.54/5.75 % SZS output start Refutation
% 5.54/5.75
% 5.54/5.75 1 [] {+} theorem(A)| -axiom(A).
% 5.54/5.75 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 5.54/5.75 3 [] {+} -theorem(implies(p,implies(implies(p,q),q))).
% 5.54/5.75 4 [] {+} axiom(implies(or(A,A),A)).
% 5.54/5.75 5 [] {+} axiom(implies(A,or(B,A))).
% 5.54/5.75 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 5.54/5.75 9 [] {-} implies(A,B)=or(not(A),B).
% 5.54/5.75 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 5.54/5.75 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 5.54/5.75 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 5.54/5.75 17 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 5.54/5.75 74 [para_into,17.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 5.54/5.75 491 [hyper,74,2,14] {+} theorem(or(A,implies(B,B))).
% 5.54/5.75 510 [hyper,491,2,13] {+} theorem(implies(A,A)).
% 5.54/5.75 611 [hyper,510,2,74] {+} theorem(or(A,implies(or(A,B),B))).
% 5.54/5.75 630 [para_into,611.1.1.2.1,10.1.1,demod,11] {-} theorem(implies(A,implies(implies(A,B),B))).
% 5.54/5.75 631 [binary,630.1,3.1] {+} $F.
% 5.54/5.75
% 5.54/5.75 % SZS output end Refutation
% 5.54/5.75 ------------ end of proof -------------
% 5.54/5.75
% 5.54/5.75
% 5.54/5.75 Search stopped by max_proofs option.
% 5.54/5.75
% 5.54/5.75
% 5.54/5.75 Search stopped by max_proofs option.
% 5.54/5.75
% 5.54/5.75 ============ end of search ============
% 5.54/5.75
% 5.54/5.75 ----------- soft-scott stats ----------
% 5.54/5.75
% 5.54/5.75 true clauses given 27 (31.0%)
% 5.54/5.75 false clauses given 60
% 5.54/5.75
% 5.54/5.75 FALSE TRUE
% 5.54/5.75 5 0 1
% 5.54/5.75 6 0 2
% 5.54/5.75 7 0 1
% 5.54/5.75 8 6 2
% 5.54/5.75 9 9 14
% 5.54/5.75 10 34 18
% 5.54/5.75 11 44 44
% 5.54/5.75 12 59 33
% 5.54/5.75 13 45 25
% 5.54/5.75 14 46 24
% 5.54/5.75 15 23 6
% 5.54/5.75 16 10 11
% 5.54/5.75 17 3 0
% 5.54/5.75 18 0 16
% 5.54/5.75 20 0 17
% 5.54/5.75 22 0 17
% 5.54/5.75 24 0 5
% 5.54/5.75 26 0 3
% 5.54/5.75 tot: 279 239 (46.1% true)
% 5.54/5.75
% 5.54/5.75
% 5.54/5.75 Model 17 [ 43 5 19523 ] (0.00 seconds, 250000 Inserts)
% 5.54/5.75
% 5.54/5.75 That finishes the proof of the theorem.
% 5.54/5.75
% 5.54/5.75 Process 4970 finished Mon Jul 4 08:32:27 2022
%------------------------------------------------------------------------------