TSTP Solution File: LCL205-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL205-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:39 EDT 2022
% Result : Unsatisfiable 10.80s 11.03s
% Output : Refutation 10.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL205-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n015.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 : Mon Jul 4 10:49:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n015.cluster.edu,
% 0.13/0.37 Mon Jul 4 10:49:16 2022
% 0.13/0.37 The command was "./sos". The process ID is 4004.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This is a Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.37 sos and nonpositive clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 3
% 0.13/0.40 number of clauses initially in problem: 11
% 0.13/0.40 percentage of clauses intially in UL: 27
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 75
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 8
% 0.13/0.40 distinct predicate count: 3
% 0.13/0.40 distinct function count: 3
% 0.13/0.40 distinct constant count: 2
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 7.69/7.86
% 7.69/7.86
% 7.69/7.86 Changing weight limit from 60 to 42.
% 7.69/7.86
% 7.69/7.86 Model 3 (0.00 seconds, 0 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on number of solutions
% 7.69/7.86
% 7.69/7.86 Model 4 (0.00 seconds, 0 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on number of solutions
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 5 [ 1 1 1373 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 6 [ 1 0 227 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 7 [ 1 1 3342 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 8 [ 1 1 505 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 9 [ 2 1 15274 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 10 [ 2 11 68494 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 11 [ 36 8 58272 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 12 [ 2 0 104 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 13 [ 36 26 110754 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 14 [ 2 2 8120 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 15 [ 3 1 2046 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Stopped by limit on insertions
% 7.69/7.86
% 7.69/7.86 Model 16 [ 3 18 72844 ] (0.00 seconds, 250000 Inserts)
% 7.69/7.86
% 7.69/7.86 Resetting weight limit to 42 after 205 givens.
% 7.69/7.86
% 9.12/9.33
% 9.12/9.33
% 9.12/9.33 Changing weight limit from 42 to 24.
% 9.12/9.33
% 9.12/9.33 Stopped by limit on insertions
% 9.12/9.33
% 9.12/9.33 Model 17 [ 3 59 200308 ] (0.00 seconds, 250000 Inserts)
% 9.12/9.33
% 9.12/9.33 Resetting weight limit to 24 after 315 givens.
% 9.12/9.33
% 9.62/9.87
% 9.62/9.87
% 9.62/9.87 Changing weight limit from 24 to 20.
% 9.62/9.87
% 9.62/9.87 Modelling stopped after 300 given clauses and 0.00 seconds
% 9.62/9.87
% 9.62/9.87
% 9.62/9.87 Resetting weight limit to 20 after 460 givens.
% 9.62/9.87
% 9.72/9.94
% 9.72/9.94
% 9.72/9.94 Changing weight limit from 20 to 16.
% 9.72/9.94
% 9.72/9.94 Resetting weight limit to 16 after 470 givens.
% 9.72/9.94
% 9.84/10.08
% 9.84/10.08
% 9.84/10.08 Changing weight limit from 16 to 15.
% 9.84/10.08
% 9.84/10.08 Resetting weight limit to 15 after 495 givens.
% 9.84/10.08
% 9.94/10.17
% 9.94/10.17
% 9.94/10.17 Changing weight limit from 15 to 14.
% 9.94/10.17
% 9.94/10.17 Resetting weight limit to 14 after 510 givens.
% 9.94/10.17
% 10.42/10.65
% 10.42/10.65
% 10.42/10.65 Changing weight limit from 14 to 13.
% 10.42/10.65
% 10.42/10.65 Resetting weight limit to 13 after 645 givens.
% 10.42/10.65
% 10.80/11.03
% 10.80/11.03 -- HEY sandbox2, WE HAVE A PROOF!! --
% 10.80/11.03
% 10.80/11.03 ----> UNIT CONFLICT at 10.56 sec ----> 20246 [binary,20245.1,3.1] {-} $F.
% 10.80/11.03
% 10.80/11.03 Length of proof is 36. Level of proof is 14.
% 10.80/11.03
% 10.80/11.03 ---------------- PROOF ----------------
% 10.80/11.03 % SZS status Unsatisfiable
% 10.80/11.03 % SZS output start Refutation
% 10.80/11.03
% 10.80/11.03 1 [] {+} theorem(A)| -axiom(A).
% 10.80/11.03 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 10.80/11.03 3 [] {+} -theorem(implies(not(implies(p,q)),implies(p,not(q)))).
% 10.80/11.03 4 [] {+} axiom(implies(or(A,A),A)).
% 10.80/11.03 5 [] {+} axiom(implies(A,or(B,A))).
% 10.80/11.03 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 10.80/11.03 7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 10.80/11.03 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 10.80/11.03 9 [] {-} implies(A,B)=or(not(A),B).
% 10.80/11.03 11,10 [copy,9,flip.1] {-} or(not(A),B)=implies(A,B).
% 10.80/11.03 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 10.80/11.03 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 10.80/11.03 15 [hyper,6,1] {-} theorem(implies(or(A,B),or(B,A))).
% 10.80/11.03 18 [para_from,10.1.1,5.1.1.2] {+} axiom(implies(A,implies(B,A))).
% 10.80/11.03 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 10.80/11.03 23 [hyper,18,1] {+} theorem(implies(A,implies(B,A))).
% 10.80/11.03 24 [para_into,15.1.1.1,10.1.1] {-} theorem(implies(implies(A,B),or(B,not(A)))).
% 10.80/11.03 25 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 10.80/11.03 26 [para_into,13.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 10.80/11.03 28 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 10.80/11.03 36 [hyper,24,2,14] {+} theorem(or(or(A,B),not(B))).
% 10.80/11.03 40 [para_into,36.1.1.1,10.1.1] {+} theorem(or(implies(A,B),not(B))).
% 10.80/11.03 58 [para_into,20.1.1.1.2,10.1.1,demod,11] {-} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 10.80/11.03 59 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 10.80/11.03 118 [hyper,28,2,26] {+} theorem(implies(or(A,implies(B,not(B))),or(A,not(B)))).
% 10.80/11.03 119 [hyper,28,2,25] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 10.80/11.03 121 [hyper,28,2,23] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 10.80/11.03 505 [para_into,119.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 10.80/11.03 635 [hyper,121,2,40] {-} theorem(or(implies(A,B),implies(C,not(B)))).
% 10.80/11.03 705 [para_into,58.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 10.80/11.03 836 [hyper,59,2,14] {+} theorem(or(A,implies(B,B))).
% 10.80/11.03 848 [hyper,836,2,13] {+} theorem(implies(A,A)).
% 10.80/11.03 861 [hyper,848,2,59] {+} theorem(or(A,implies(or(A,B),B))).
% 10.80/11.03 863 [hyper,848,2,24] {+} theorem(or(A,not(A))).
% 10.80/11.03 1020 [hyper,863,2,14] {+} theorem(or(A,or(B,not(B)))).
% 10.80/11.03 1765 [hyper,1020,2,20] {+} theorem(or(A,or(B,not(A)))).
% 10.80/11.03 2084 [hyper,1765,2,119] {+} theorem(or(A,implies(A,B))).
% 10.80/11.03 2168 [para_into,2084.1.1,10.1.1] {+} theorem(implies(A,implies(not(A),B))).
% 10.80/11.03 2181 [hyper,2168,2,28] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 10.80/11.03 4246 [hyper,861,2,15] {+} theorem(or(implies(or(A,B),B),A)).
% 10.80/11.03 5565 [hyper,118,2,505] {-} theorem(implies(or(A,implies(B,not(B))),implies(B,A))).
% 10.80/11.03 12060 [hyper,4246,2,2181] {-} theorem(or(implies(or(A,B),B),implies(not(A),C))).
% 10.80/11.03 18808 [hyper,12060,2,5565] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 10.80/11.03 20148 [hyper,705,2,18808] {-} theorem(implies(or(A,B),implies(not(A),B))).
% 10.80/11.03 20245 [hyper,20148,2,635] {-} theorem(implies(not(implies(A,B)),implies(C,not(B)))).
% 10.80/11.03 20246 [binary,20245.1,3.1] {-} $F.
% 10.80/11.03
% 10.80/11.03 % SZS output end Refutation
% 10.80/11.03 ------------ end of proof -------------
% 10.80/11.03
% 10.80/11.03
% 10.80/11.03 Search stopped by max_proofs option.
% 10.80/11.03
% 10.80/11.03
% 10.80/11.03 Search stopped by max_proofs option.
% 10.80/11.03
% 10.80/11.03 ============ end of search ============
% 10.80/11.03
% 10.80/11.03 ----------- soft-scott stats ----------
% 10.80/11.03
% 10.80/11.03 true clauses given 300 (32.4%)
% 10.80/11.03 false clauses given 627
% 10.80/11.03
% 10.80/11.03 FALSE TRUE
% 10.80/11.03 9 1 34
% 10.80/11.03 10 1 480
% 10.80/11.03 11 183 457
% 10.80/11.03 12 565 1512
% 10.80/11.03 13 1768 50
% 10.80/11.03 tot: 2518 2533 (50.1% true)
% 10.80/11.03
% 10.80/11.03
% 10.80/11.03 Model 17 [ 3 59 200308 ] (0.00 seconds, 250000 Inserts)
% 10.80/11.03
% 10.80/11.03 That finishes the proof of the theorem.
% 10.80/11.03
% 10.80/11.03 Process 4004 finished Mon Jul 4 10:49:27 2022
%------------------------------------------------------------------------------