TSTP Solution File: LCL181-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL181-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:24 EDT 2022
% Result : Unsatisfiable 14.39s 14.57s
% Output : Refutation 14.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL181-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.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 19:24:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n014.cluster.edu,
% 0.13/0.36 Sat Jul 2 19:24:25 2022
% 0.13/0.36 The command was "./sos". The process ID is 31477.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 3
% 0.19/0.40 number of clauses initially in problem: 11
% 0.19/0.40 percentage of clauses intially in UL: 27
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 75
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 8
% 0.19/0.40 distinct predicate count: 3
% 0.19/0.40 distinct function count: 3
% 0.19/0.40 distinct constant count: 2
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 8.63/8.86
% 8.63/8.86
% 8.63/8.86 Changing weight limit from 60 to 58.
% 8.63/8.86
% 8.63/8.86 Model 3 (0.00 seconds, 0 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on number of solutions
% 8.63/8.86
% 8.63/8.86 Model 4 (0.00 seconds, 0 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on number of solutions
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 5 [ 1 2 4607 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 6 [ 1 0 883 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 7 [ 1 0 962 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 8 [ 1 0 149 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 9 [ 1 2 15507 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 10 [ 2 3 45171 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 11 [ 35 2 12957 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 12 [ 1 4 33471 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Stopped by limit on insertions
% 8.63/8.86
% 8.63/8.86 Model 13 [ 3 0 288 ] (0.00 seconds, 250000 Inserts)
% 8.63/8.86
% 8.63/8.86 Resetting weight limit to 58 after 255 givens.
% 8.63/8.86
% 10.61/10.85
% 10.61/10.85
% 10.61/10.85 Changing weight limit from 58 to 56.
% 10.61/10.85
% 10.61/10.85 Stopped by limit on insertions
% 10.61/10.85
% 10.61/10.85 Model 14 [ 3 1 863 ] (0.00 seconds, 250000 Inserts)
% 10.61/10.85
% 10.61/10.85 Stopped by limit on insertions
% 10.61/10.85
% 10.61/10.85 Model 15 [ 3 1 161 ] (0.00 seconds, 250000 Inserts)
% 10.61/10.85
% 10.61/10.85 Resetting weight limit to 56 after 420 givens.
% 10.61/10.85
% 10.70/10.88
% 10.70/10.88
% 10.70/10.88 Changing weight limit from 56 to 32.
% 10.70/10.88
% 10.70/10.88 Resetting weight limit to 32 after 425 givens.
% 10.70/10.88
% 10.76/11.02
% 10.76/11.02
% 10.76/11.02 Changing weight limit from 32 to 27.
% 10.76/11.02
% 10.76/11.02 Resetting weight limit to 27 after 430 givens.
% 10.76/11.02
% 11.04/11.24
% 11.04/11.24
% 11.04/11.24 Changing weight limit from 27 to 18.
% 11.04/11.24
% 11.04/11.24 Resetting weight limit to 18 after 435 givens.
% 11.04/11.24
% 11.07/11.30
% 11.07/11.30
% 11.07/11.30 Changing weight limit from 18 to 17.
% 11.07/11.30
% 11.07/11.30 Resetting weight limit to 17 after 440 givens.
% 11.07/11.30
% 11.20/11.40
% 11.20/11.40
% 11.20/11.40 Changing weight limit from 17 to 16.
% 11.20/11.40
% 11.20/11.40 Modelling stopped after 300 given clauses and 0.00 seconds
% 11.20/11.40
% 11.20/11.40
% 11.20/11.40 Resetting weight limit to 16 after 455 givens.
% 11.20/11.40
% 11.45/11.68
% 11.45/11.68
% 11.45/11.68 Changing weight limit from 16 to 15.
% 11.45/11.68
% 11.45/11.68 Resetting weight limit to 15 after 480 givens.
% 11.45/11.68
% 12.56/12.74
% 12.56/12.74
% 12.56/12.74 Changing weight limit from 15 to 14.
% 12.56/12.74
% 12.56/12.74 Resetting weight limit to 14 after 745 givens.
% 12.56/12.74
% 14.39/14.57
% 14.39/14.57 -- HEY sandbox, WE HAVE A PROOF!! --
% 14.39/14.57
% 14.39/14.57 ----> UNIT CONFLICT at 14.01 sec ----> 42296 [binary,42295.1,3.1] {+} $F.
% 14.39/14.57
% 14.39/14.57 Length of proof is 47. Level of proof is 22.
% 14.39/14.57
% 14.39/14.57 ---------------- PROOF ----------------
% 14.39/14.57 % SZS status Unsatisfiable
% 14.39/14.57 % SZS output start Refutation
% 14.39/14.57
% 14.39/14.57 1 [] {+} theorem(A)| -axiom(A).
% 14.39/14.57 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 14.39/14.57 3 [] {+} -theorem(implies(implies(not(p),q),implies(not(q),p))).
% 14.39/14.57 4 [] {+} axiom(implies(or(A,A),A)).
% 14.39/14.57 5 [] {+} axiom(implies(A,or(B,A))).
% 14.39/14.57 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 14.39/14.57 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 14.39/14.57 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 14.39/14.57 9 [] {-} implies(A,B)=or(not(A),B).
% 14.39/14.57 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 14.39/14.57 13 [hyper,4,1] {-} theorem(implies(or(A,A),A)).
% 14.39/14.57 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 14.39/14.57 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 14.39/14.57 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 14.39/14.57 23 [para_into,13.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 14.39/14.57 26 [para_into,14.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 14.39/14.57 28 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 14.39/14.57 29 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 14.39/14.57 30 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 14.39/14.57 59 [para_into,20.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 14.39/14.57 60 [para_into,20.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 14.39/14.57 128 [hyper,28,2,26] {+} theorem(or(implies(A,B),not(B))).
% 14.39/14.57 146 [hyper,128,2,14] {+} theorem(or(A,or(implies(B,C),not(C)))).
% 14.39/14.57 154 [hyper,30,2,29] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 14.39/14.57 155 [hyper,30,2,28] {+} theorem(implies(or(A,implies(B,C)),or(A,or(C,not(B))))).
% 14.39/14.57 157 [hyper,30,2,23] {+} theorem(implies(or(A,implies(B,not(B))),or(A,not(B)))).
% 14.39/14.57 501 [hyper,146,2,20] {-} theorem(or(implies(A,B),or(C,not(B)))).
% 14.39/14.57 521 [para_into,154.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 14.39/14.57 617 [hyper,521,2,14] {+} theorem(implies(not(A),implies(A,B))).
% 14.39/14.57 624 [hyper,617,2,30] {-} theorem(implies(or(A,not(B)),or(A,implies(B,C)))).
% 14.39/14.57 648 [hyper,501,2,154] {+} theorem(or(implies(A,B),implies(B,C))).
% 14.39/14.57 663 [hyper,648,2,13] {+} theorem(implies(A,A)).
% 14.39/14.57 688 [hyper,663,2,28] {+} theorem(or(A,not(A))).
% 14.39/14.57 909 [para_into,59.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 14.39/14.57 1073 [hyper,60,2,663] {+} theorem(or(A,implies(or(A,B),B))).
% 14.39/14.57 1081 [hyper,60,2,15] {+} theorem(or(A,implies(or(B,A),B))).
% 14.39/14.57 1369 [hyper,624,2,688] {+} theorem(or(A,implies(A,B))).
% 14.39/14.57 1430 [para_into,1369.1.1,10.1.1] {+} theorem(implies(A,implies(not(A),B))).
% 14.39/14.57 1450 [hyper,1430,2,30] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 14.39/14.57 1846 [hyper,1450,2,128] {-} theorem(or(implies(A,B),implies(not(not(B)),C))).
% 14.39/14.57 2129 [hyper,1846,2,13] {+} theorem(implies(not(not(A)),A)).
% 14.39/14.57 2142 [hyper,2129,2,30] {+} theorem(implies(or(A,not(not(B))),or(A,B))).
% 14.39/14.57 5860 [hyper,1073,2,15] {+} theorem(or(implies(or(A,B),B),A)).
% 14.39/14.57 8405 [hyper,5860,2,1450] {-} theorem(or(implies(or(A,B),B),implies(not(A),C))).
% 14.39/14.57 10934 [hyper,155,2,1081] {+} theorem(or(A,or(B,not(or(B,A))))).
% 14.39/14.57 12351 [hyper,157,2,521] {-} theorem(implies(or(A,implies(B,not(B))),implies(B,A))).
% 14.39/14.57 18354 [hyper,12351,2,8405] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 14.39/14.57 33884 [hyper,909,2,18354] {-} theorem(implies(or(A,B),implies(not(A),B))).
% 14.39/14.57 33976 [hyper,33884,2,10934] {-} theorem(implies(not(A),or(B,not(or(B,A))))).
% 14.39/14.57 34413 [hyper,33976,2,60] {-} theorem(or(A,implies(not(B),not(or(A,B))))).
% 14.39/14.57 34582 [hyper,34413,2,15] {-} theorem(or(implies(not(A),not(or(B,A))),B)).
% 14.39/14.57 41727 [hyper,2142,2,34582,demod,11] {-} theorem(or(implies(not(A),not(implies(not(B),A))),B)).
% 14.39/14.57 41921 [hyper,41727,2,15] {-} theorem(or(A,implies(not(B),not(implies(not(A),B))))).
% 14.39/14.57 42017 [hyper,41921,2,59] {-} theorem(implies(not(A),or(B,not(implies(not(B),A))))).
% 14.39/14.57 42094 [hyper,42017,2,521] {-} theorem(implies(not(A),implies(implies(not(B),A),B))).
% 14.39/14.57 42295 [hyper,42094,2,909] {-} theorem(implies(implies(not(A),B),implies(not(B),A))).
% 14.39/14.57 42296 [binary,42295.1,3.1] {+} $F.
% 14.39/14.57
% 14.39/14.57 % SZS output end Refutation
% 14.39/14.57 ------------ end of proof -------------
% 14.39/14.57
% 14.39/14.57
% 14.39/14.57 Search stopped by max_proofs option.
% 14.39/14.57
% 14.39/14.57
% 14.39/14.57 Search stopped by max_proofs option.
% 14.39/14.57
% 14.39/14.57 ============ end of search ============
% 14.39/14.57
% 14.39/14.57 ----------- soft-scott stats ----------
% 14.39/14.57
% 14.39/14.57 true clauses given 458 (30.3%)
% 14.39/14.57 false clauses given 1052
% 14.39/14.57
% 14.39/14.57 FALSE TRUE
% 14.39/14.57 8 0 1
% 14.39/14.57 9 0 2
% 14.39/14.57 10 1 608
% 14.39/14.57 11 1 1156
% 14.39/14.57 12 290 733
% 14.39/14.57 13 2153 0
% 14.39/14.57 14 55 0
% 14.39/14.57 tot: 2500 2500 (50.0% true)
% 14.39/14.57
% 14.39/14.57
% 14.39/14.57 Model 15 [ 3 1 161 ] (0.00 seconds, 250000 Inserts)
% 14.39/14.57
% 14.39/14.57 That finishes the proof of the theorem.
% 14.39/14.57
% 14.39/14.57 Process 31477 finished Sat Jul 2 19:24:39 2022
%------------------------------------------------------------------------------