TSTP Solution File: LCL211-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL211-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:28:43 EDT 2022
% Result : Unsatisfiable 6.97s 7.16s
% Output : Refutation 6.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL211-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 2 14:43:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n007.cluster.edu,
% 0.12/0.36 Sat Jul 2 14:43:25 2022
% 0.12/0.36 The command was "./sos". The process ID is 4422.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36 sos and nonpositive clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/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: 87
% 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 ===========
% 5.29/5.47
% 5.29/5.47
% 5.29/5.47 Changing weight limit from 60 to 30.
% 5.29/5.47
% 5.29/5.47 Model 3 (0.00 seconds, 0 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on number of solutions
% 5.29/5.47
% 5.29/5.47 Model 4 (0.00 seconds, 0 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on number of solutions
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Model 5 [ 1 3 15752 ] (0.00 seconds, 250000 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Model 6 [ 21 4 46067 ] (0.00 seconds, 250000 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Model 7 [ 24 0 1801 ] (0.00 seconds, 250000 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Model 8 [ 1 1 5035 ] (0.00 seconds, 250000 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Model 9 [ 22 7 62435 ] (0.00 seconds, 250000 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Model 10 [ 1 2 7190 ] (0.00 seconds, 250000 Inserts)
% 5.29/5.47
% 5.29/5.47 Stopped by limit on insertions
% 5.29/5.47
% 5.29/5.47 Resetting weight limit to 30 after 300 givens.
% 5.29/5.47
% 5.29/5.53
% 5.29/5.53
% 5.29/5.53 Changing weight limit from 30 to 24.
% 5.29/5.53
% 5.29/5.53 Resetting weight limit to 24 after 310 givens.
% 5.29/5.53
% 5.41/5.62
% 5.41/5.62
% 5.41/5.62 Changing weight limit from 24 to 20.
% 5.41/5.62
% 5.41/5.62 Resetting weight limit to 20 after 315 givens.
% 5.41/5.62
% 5.46/5.64
% 5.46/5.64
% 5.46/5.64 Changing weight limit from 20 to 18.
% 5.46/5.64
% 5.46/5.64 Resetting weight limit to 18 after 320 givens.
% 5.46/5.64
% 6.19/6.43
% 6.19/6.43
% 6.19/6.43 Changing weight limit from 18 to 17.
% 6.19/6.43
% 6.19/6.43 Stopped by limit on insertions
% 6.19/6.43
% 6.19/6.43 Resetting weight limit to 17 after 340 givens.
% 6.19/6.43
% 6.45/6.65
% 6.45/6.65
% 6.45/6.65 Changing weight limit from 17 to 16.
% 6.45/6.65
% 6.45/6.65 Resetting weight limit to 16 after 375 givens.
% 6.45/6.65
% 6.74/6.93
% 6.74/6.93
% 6.74/6.93 Changing weight limit from 16 to 15.
% 6.74/6.93
% 6.74/6.93 Resetting weight limit to 15 after 440 givens.
% 6.74/6.93
% 6.97/7.16
% 6.97/7.16 -------- PROOF --------
% 6.97/7.16 % SZS status Unsatisfiable
% 6.97/7.16 % SZS output start Refutation
% 6.97/7.16
% 6.97/7.16 ----> UNIT CONFLICT at 6.76 sec ----> 10913 [binary,10912.1,3.1] {-} $F.
% 6.97/7.16
% 6.97/7.16 Length of proof is 26. Level of proof is 12.
% 6.97/7.16
% 6.97/7.16 ---------------- PROOF ----------------
% 6.97/7.16 % SZS status Unsatisfiable
% 6.97/7.16 % SZS output start Refutation
% 6.97/7.16
% 6.97/7.16 1 [] {+} theorem(A)| -axiom(A).
% 6.97/7.16 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 6.97/7.16 3 [] {+} -theorem(implies(not(q),implies(or(p,q),p))).
% 6.97/7.16 4 [] {+} axiom(implies(or(A,A),A)).
% 6.97/7.16 5 [] {+} axiom(implies(A,or(B,A))).
% 6.97/7.16 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 6.97/7.16 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 6.97/7.16 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 6.97/7.16 9 [] {-} implies(A,B)=or(not(A),B).
% 6.97/7.16 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 6.97/7.16 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 6.97/7.16 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 6.97/7.16 15 [hyper,6,1] {-} theorem(implies(or(A,B),or(B,A))).
% 6.97/7.16 20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 6.97/7.16 23 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 6.97/7.16 24 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 6.97/7.16 28 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 6.97/7.16 30 [para_into,20.1.1.1.2,10.1.1,demod,11] {-} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 6.97/7.16 31 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 6.97/7.16 117 [hyper,28,2,24] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 6.97/7.16 121 [hyper,28,2,14] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 6.97/7.16 122 [hyper,28,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 6.97/7.16 149 [para_into,122.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,B)),implies(A,B))).
% 6.97/7.16 193 [hyper,31,2,15] {+} theorem(or(A,implies(or(B,A),B))).
% 6.97/7.16 194 [hyper,31,2,14] {+} theorem(or(A,implies(B,B))).
% 6.97/7.16 199 [hyper,193,2,15] {+} theorem(or(implies(or(A,B),A),B)).
% 6.97/7.16 206 [hyper,194,2,13] {+} theorem(implies(A,A)).
% 6.97/7.16 211 [hyper,206,2,23] {+} theorem(or(A,not(A))).
% 6.97/7.16 217 [hyper,211,2,121] {+} theorem(or(A,or(B,not(A)))).
% 6.97/7.16 1023 [hyper,117,2,217] {+} theorem(or(A,implies(A,B))).
% 6.97/7.16 1036 [para_into,1023.1.1,10.1.1] {+} theorem(implies(A,implies(not(A),B))).
% 6.97/7.16 1491 [hyper,1036,2,28] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 6.97/7.16 2656 [hyper,199,2,1491] {-} theorem(or(implies(or(A,B),A),implies(not(B),C))).
% 6.97/7.16 6503 [hyper,2656,2,30] {-} theorem(implies(not(A),or(implies(or(B,A),B),C))).
% 6.97/7.16 10912 [hyper,149,2,6503] {-} theorem(implies(not(A),implies(or(B,A),B))).
% 6.97/7.16 10913 [binary,10912.1,3.1] {-} $F.
% 6.97/7.16
% 6.97/7.16 % SZS output end Refutation
% 6.97/7.16 ------------ end of proof -------------
% 6.97/7.16
% 6.97/7.16
% 6.97/7.16 Search stopped by max_proofs option.
% 6.97/7.16
% 6.97/7.16
% 6.97/7.16 Search stopped by max_proofs option.
% 6.97/7.16
% 6.97/7.16 ============ end of search ============
% 6.97/7.16
% 6.97/7.16 ----------- soft-scott stats ----------
% 6.97/7.16
% 6.97/7.16 true clauses given 174 (37.3%)
% 6.97/7.16 false clauses given 292
% 6.97/7.16
% 6.97/7.16 FALSE TRUE
% 6.97/7.16 8 0 17
% 6.97/7.16 9 0 118
% 6.97/7.16 10 0 396
% 6.97/7.16 11 55 411
% 6.97/7.16 12 486 983
% 6.97/7.16 13 784 681
% 6.97/7.16 14 911 13
% 6.97/7.16 15 472 14
% 6.97/7.16 tot: 2708 2633 (49.3% true)
% 6.97/7.16
% 6.97/7.16
% 6.97/7.16 Model 10 [ 1 -170 7190 ] (0.00 seconds, 250000 Inserts)
% 6.97/7.16
% 6.97/7.16 That finishes the proof of the theorem.
% 6.97/7.16
% 6.97/7.16 Process 4422 finished Sat Jul 2 14:43:32 2022
%------------------------------------------------------------------------------