TSTP Solution File: LCL239-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:01 EDT 2022
% Result : Unsatisfiable 1.77s 1.94s
% Output : Refutation 1.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL239-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 4 20:15:42 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n007.cluster.edu,
% 0.14/0.36 Mon Jul 4 20:15:42 2022
% 0.14/0.36 The command was "./sos". The process ID is 27582.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36 sos and nonpositive clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 3
% 0.20/0.39 number of clauses initially in problem: 13
% 0.20/0.39 percentage of clauses intially in UL: 23
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 8
% 0.20/0.39 distinct predicate count: 3
% 0.20/0.39 distinct function count: 4
% 0.20/0.39 distinct constant count: 1
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 1.77/1.94
% 1.77/1.94 -------- PROOF --------
% 1.77/1.94 % SZS status Unsatisfiable
% 1.77/1.94 % SZS output start Refutation
% 1.77/1.94
% 1.77/1.94 Model 3 (0.00 seconds, 0 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on number of solutions
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 4 [ 4 1 74 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 5 [ 21 1 153 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 6 [ 30 0 110 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 7 [ 8 1 92 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 8 [ 21 1 778 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 9 (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on number of solutions
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 10 [ 1 0 419 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 11 [ 3 0 141 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 12 [ 33 1 69 ] (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on insertions
% 1.77/1.94
% 1.77/1.94 Model 13 (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 Stopped by limit on number of solutions
% 1.77/1.94
% 1.77/1.94 ----> UNIT CONFLICT at 1.55 sec ----> 1645 [binary,1644.1,3.1] {-} $F.
% 1.77/1.94
% 1.77/1.94 Length of proof is 35. Level of proof is 18.
% 1.77/1.94
% 1.77/1.94 ---------------- PROOF ----------------
% 1.77/1.94 % SZS status Unsatisfiable
% 1.77/1.94 % SZS output start Refutation
% 1.77/1.94
% 1.77/1.94 1 [] {+} theorem(A)| -axiom(A).
% 1.77/1.94 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 1.77/1.94 3 [] {+} -theorem(not(and(p,not(p)))).
% 1.77/1.94 4 [] {+} axiom(implies(or(A,A),A)).
% 1.77/1.94 5 [] {+} axiom(implies(A,or(B,A))).
% 1.77/1.94 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 1.77/1.94 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.77/1.94 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.77/1.94 9 [] {-} implies(A,B)=or(not(A),B).
% 1.77/1.94 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 1.77/1.94 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 1.77/1.94 13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 1.77/1.94 16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 1.77/1.94 17 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 1.77/1.94 18 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 1.77/1.94 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.77/1.94 25 [para_from,10.1.1,17.1.1.2] {+} theorem(implies(A,implies(B,A))).
% 1.77/1.94 29 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 1.77/1.94 34 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.77/1.94 38 [para_into,18.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 1.77/1.94 39 [para_into,18.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 1.77/1.94 45 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 1.77/1.94 46 [copy,45,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 1.77/1.94 64 [para_into,20.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 1.77/1.94 81 [para_from,46.1.1,2.2.1] {-} theorem(A)| -theorem(or(and(B,C),A))| -theorem(implies(B,not(C))).
% 1.77/1.94 91 [para_into,39.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 1.77/1.94 98 [para_into,91.1.1,46.1.1] {+} theorem(or(and(A,B),implies(B,not(A)))).
% 1.77/1.94 259 [hyper,34,2,39] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 1.77/1.94 315 [para_into,259.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 1.77/1.94 330 [hyper,315,2,17] {+} theorem(implies(not(A),implies(A,B))).
% 1.77/1.94 348 [para_into,330.1.1.1,13.1.1] {-} theorem(implies(and(A,B),implies(implies(A,not(B)),C))).
% 1.77/1.94 384 [hyper,38,2,348] {-} theorem(or(implies(implies(A,not(B)),C),not(and(A,B)))).
% 1.77/1.94 406 [hyper,384,2,17] {-} theorem(or(A,or(implies(implies(B,not(C)),D),not(and(B,C))))).
% 1.77/1.94 596 [hyper,406,2,20] {-} theorem(or(implies(implies(A,not(B)),C),or(D,not(and(A,B))))).
% 1.77/1.94 640 [para_into,596.1.1.2,10.1.1] {-} theorem(or(implies(implies(A,not(B)),C),implies(D,not(and(A,B))))).
% 1.77/1.94 694 [hyper,640,2,16] {-} theorem(implies(implies(A,not(B)),not(and(A,B)))).
% 1.77/1.94 719 [hyper,694,2,29] {-} theorem(not(and(implies(A,not(A)),A))).
% 1.77/1.94 727 [hyper,719,2,25] {-} theorem(implies(A,not(and(implies(B,not(B)),B)))).
% 1.77/1.94 756 [hyper,727,2,694] {-} theorem(not(and(A,and(implies(B,not(B)),B)))).
% 1.77/1.94 795 [hyper,756,2,330] {-} theorem(implies(and(A,and(implies(B,not(B)),B)),C)).
% 1.77/1.94 1221 [hyper,64,2,17] {+} theorem(or(A,implies(B,B))).
% 1.77/1.94 1234 [hyper,1221,81,795] {+} theorem(implies(A,A)).
% 1.77/1.94 1273 [hyper,1234,81,98] {+} theorem(implies(A,not(not(A)))).
% 1.77/1.94 1279 [hyper,1234,2,38] {+} theorem(or(A,not(A))).
% 1.77/1.94 1644 [hyper,1273,81,1279] {-} theorem(not(and(A,not(A)))).
% 1.77/1.94 1645 [binary,1644.1,3.1] {-} $F.
% 1.77/1.94
% 1.77/1.94 % SZS output end Refutation
% 1.77/1.94 ------------ end of proof -------------
% 1.77/1.94
% 1.77/1.94
% 1.77/1.94 Search stopped by max_proofs option.
% 1.77/1.94
% 1.77/1.94
% 1.77/1.94 Search stopped by max_proofs option.
% 1.77/1.94
% 1.77/1.94 ============ end of search ============
% 1.77/1.94
% 1.77/1.94 ----------- soft-scott stats ----------
% 1.77/1.94
% 1.77/1.94 true clauses given 57 (32.2%)
% 1.77/1.94 false clauses given 120
% 1.77/1.94
% 1.77/1.94 FALSE TRUE
% 1.77/1.94 7 0 2
% 1.77/1.94 8 0 15
% 1.77/1.94 9 0 20
% 1.77/1.94 10 0 49
% 1.77/1.94 11 3 37
% 1.77/1.94 12 20 50
% 1.77/1.94 13 17 50
% 1.77/1.94 14 29 55
% 1.77/1.94 15 36 38
% 1.77/1.94 16 39 66
% 1.77/1.94 17 52 39
% 1.77/1.94 18 60 66
% 1.77/1.94 19 35 19
% 1.77/1.94 20 24 40
% 1.77/1.94 21 38 22
% 1.77/1.94 22 68 65
% 1.77/1.94 23 39 36
% 1.77/1.94 24 29 37
% 1.77/1.94 25 21 7
% 1.77/1.94 26 23 43
% 1.77/1.94 27 21 11
% 1.77/1.94 28 0 33
% 1.77/1.94 30 0 11
% 1.77/1.94 34 0 4
% 1.77/1.94 36 0 4
% 1.77/1.94 tot: 554 819 (59.7% true)
% 1.77/1.94
% 1.77/1.94
% 1.77/1.94 Model 13 (0.00 seconds, 250000 Inserts)
% 1.77/1.94
% 1.77/1.94 That finishes the proof of the theorem.
% 1.77/1.94
% 1.77/1.94 Process 27582 finished Mon Jul 4 20:15:43 2022
%------------------------------------------------------------------------------