TSTP Solution File: LCL202-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL202-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:37 EDT 2022
% Result : Unsatisfiable 12.05s 12.24s
% Output : Refutation 12.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL202-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n005.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 : Mon Jul 4 02:10:07 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 sandbox on n005.cluster.edu,
% 0.12/0.36 Mon Jul 4 02:10:07 2022
% 0.12/0.36 The command was "./sos". The process ID is 14809.
% 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.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 3
% 0.12/0.40 number of clauses initially in problem: 11
% 0.12/0.40 percentage of clauses intially in UL: 27
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 87
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 8
% 0.12/0.40 distinct predicate count: 3
% 0.12/0.40 distinct function count: 3
% 0.12/0.40 distinct constant count: 2
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 10.13/10.38
% 10.13/10.38
% 10.13/10.38 Changing weight limit from 60 to 44.
% 10.13/10.38
% 10.13/10.38 Model 3 (0.00 seconds, 0 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on number of solutions
% 10.13/10.38
% 10.13/10.38 Model 4 (0.00 seconds, 0 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on number of solutions
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 5 [ 21 1 126 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 6 [ 1 1 6722 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 7 [ 1 1 2401 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 8 [ 1 2 23423 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 9 [ 22 1 2284 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 10 [ 1 1 11719 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 11 [ 1 1 5376 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 12 [ 2 0 1135 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 13 [ 2 18 103356 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 14 [ 3 1 2532 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 15 [ 3 18 87184 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 16 [ 3 31 138999 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 17 [ 4 16 58478 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 18 [ 4 7 21385 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 19 [ 4 33 85610 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Stopped by limit on insertions
% 10.13/10.38
% 10.13/10.38 Model 20 [ 4 71 196374 ] (0.00 seconds, 250000 Inserts)
% 10.13/10.38
% 10.13/10.38 Resetting weight limit to 44 after 215 givens.
% 10.13/10.38
% 10.92/11.13
% 10.92/11.13
% 10.92/11.13 Changing weight limit from 44 to 38.
% 10.92/11.13
% 10.92/11.13 Resetting weight limit to 38 after 410 givens.
% 10.92/11.13
% 10.92/11.15
% 10.92/11.15
% 10.92/11.15 Changing weight limit from 38 to 31.
% 10.92/11.15
% 10.92/11.15 Resetting weight limit to 31 after 415 givens.
% 10.92/11.15
% 10.92/11.16
% 10.92/11.16
% 10.92/11.16 Changing weight limit from 31 to 28.
% 10.92/11.16
% 10.92/11.16 Resetting weight limit to 28 after 420 givens.
% 10.92/11.16
% 10.92/11.18
% 10.92/11.18
% 10.92/11.18 Changing weight limit from 28 to 27.
% 10.92/11.18
% 10.92/11.18 Resetting weight limit to 27 after 425 givens.
% 10.92/11.18
% 11.03/11.20
% 11.03/11.20
% 11.03/11.20 Changing weight limit from 27 to 25.
% 11.03/11.20
% 11.03/11.20 Resetting weight limit to 25 after 430 givens.
% 11.03/11.20
% 11.04/11.22
% 11.04/11.22
% 11.04/11.22 Changing weight limit from 25 to 23.
% 11.04/11.22
% 11.04/11.22 Resetting weight limit to 23 after 435 givens.
% 11.04/11.22
% 11.14/11.31
% 11.14/11.31
% 11.14/11.31 Changing weight limit from 23 to 20.
% 11.14/11.31
% 11.14/11.31 Resetting weight limit to 20 after 440 givens.
% 11.14/11.31
% 11.14/11.39
% 11.14/11.39
% 11.14/11.39 Changing weight limit from 20 to 19.
% 11.14/11.39
% 11.14/11.39 Resetting weight limit to 19 after 445 givens.
% 11.14/11.39
% 11.22/11.46
% 11.22/11.46
% 11.22/11.46 Changing weight limit from 19 to 17.
% 11.22/11.46
% 11.22/11.46 Modelling stopped after 300 given clauses and 0.00 seconds
% 11.22/11.46
% 11.22/11.46
% 11.22/11.46 Resetting weight limit to 17 after 450 givens.
% 11.22/11.46
% 11.31/11.48
% 11.31/11.48
% 11.31/11.48 Changing weight limit from 17 to 16.
% 11.31/11.48
% 11.31/11.48 Resetting weight limit to 16 after 460 givens.
% 11.31/11.48
% 11.35/11.56
% 11.35/11.56
% 11.35/11.56 Changing weight limit from 16 to 15.
% 11.35/11.56
% 11.35/11.56 Resetting weight limit to 15 after 485 givens.
% 11.35/11.56
% 11.43/11.63
% 11.43/11.63
% 11.43/11.63 Changing weight limit from 15 to 14.
% 11.43/11.63
% 11.43/11.63 Resetting weight limit to 14 after 495 givens.
% 11.43/11.63
% 12.05/12.24
% 12.05/12.24 -- HEY sandbox, WE HAVE A PROOF!! --
% 12.05/12.24
% 12.05/12.24 ----> UNIT CONFLICT at 11.80 sec ----> 18975 [binary,18974.1,3.1] {-} $F.
% 12.05/12.24
% 12.05/12.24 Length of proof is 28. Level of proof is 15.
% 12.05/12.24
% 12.05/12.24 ---------------- PROOF ----------------
% 12.05/12.24 % SZS status Unsatisfiable
% 12.05/12.24 % SZS output start Refutation
% 12.05/12.24
% 12.05/12.24 1 [] {+} theorem(A)| -axiom(A).
% 12.05/12.24 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 12.05/12.24 3 [] {+} -theorem(implies(not(or(p,q)),or(p,not(q)))).
% 12.05/12.24 4 [] {+} axiom(implies(or(A,A),A)).
% 12.05/12.24 5 [] {+} axiom(implies(A,or(B,A))).
% 12.05/12.24 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 12.05/12.24 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 12.05/12.24 9 [] {-} implies(A,B)=or(not(A),B).
% 12.05/12.24 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 12.05/12.24 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 12.05/12.24 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 12.05/12.24 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 12.05/12.24 24 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 12.05/12.24 25 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 12.05/12.24 29 [para_into,14.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 12.05/12.24 31 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 12.05/12.24 96 [hyper,24,2,14] {+} theorem(or(or(A,B),not(B))).
% 12.05/12.24 114 [hyper,31,2,29] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 12.05/12.24 115 [hyper,31,2,25] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 12.05/12.24 120 [hyper,31,2,14] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 12.05/12.24 121 [hyper,31,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 12.05/12.24 186 [hyper,120,2,96] {-} theorem(or(or(A,B),or(C,not(B)))).
% 12.05/12.24 190 [para_into,120.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(A,or(C,B)))).
% 12.05/12.24 195 [hyper,186,2,15] {-} theorem(or(or(A,not(B)),or(C,B))).
% 12.05/12.24 233 [hyper,121,2,195] {+} theorem(or(or(A,not(B)),B)).
% 12.05/12.24 235 [para_into,121.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,B)),implies(A,B))).
% 12.05/12.24 246 [hyper,233,2,15] {+} theorem(or(A,or(B,not(A)))).
% 12.05/12.24 254 [hyper,235,2,114] {+} theorem(implies(or(implies(A,B),B),implies(A,B))).
% 12.05/12.24 482 [hyper,246,2,115] {+} theorem(or(A,implies(A,B))).
% 12.05/12.24 494 [para_into,482.1.1,10.1.1] {+} theorem(implies(A,implies(not(A),B))).
% 12.05/12.24 498 [hyper,494,2,31] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 12.05/12.24 1917 [para_into,498.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,B),implies(A,implies(not(B),C)))).
% 12.05/12.24 6082 [hyper,1917,2,14] {-} theorem(implies(A,implies(not(or(B,A)),C))).
% 12.05/12.24 6423 [hyper,6082,2,24] {-} theorem(or(implies(not(or(A,B)),C),not(B))).
% 12.05/12.24 18906 [hyper,254,2,6423] {-} theorem(implies(not(or(A,B)),not(B))).
% 12.05/12.24 18974 [hyper,18906,2,190] {-} theorem(implies(not(or(A,B)),or(C,not(B)))).
% 12.05/12.24 18975 [binary,18974.1,3.1] {-} $F.
% 12.05/12.24
% 12.05/12.24 % SZS output end Refutation
% 12.05/12.24 ------------ end of proof -------------
% 12.05/12.24
% 12.05/12.24
% 12.05/12.24 Search stopped by max_proofs option.
% 12.05/12.24
% 12.05/12.24
% 12.05/12.24 Search stopped by max_proofs option.
% 12.05/12.24
% 12.05/12.24 ============ end of search ============
% 12.05/12.24
% 12.05/12.24 ----------- soft-scott stats ----------
% 12.05/12.24
% 12.05/12.24 true clauses given 264 (35.5%)
% 12.05/12.24 false clauses given 479
% 12.05/12.24
% 12.05/12.24 FALSE TRUE
% 12.05/12.24 8 0 1
% 12.05/12.24 9 1 76
% 12.05/12.24 10 7 520
% 12.05/12.24 11 56 455
% 12.05/12.24 12 452 1455
% 12.05/12.24 13 1977 0
% 12.05/12.24 14 70 21
% 12.05/12.24 tot: 2563 2528 (49.7% true)
% 12.05/12.24
% 12.05/12.24
% 12.05/12.24 Model 20 [ 4 71 196374 ] (0.00 seconds, 250000 Inserts)
% 12.05/12.24
% 12.05/12.24 That finishes the proof of the theorem.
% 12.05/12.24
% 12.05/12.24 Process 14809 finished Mon Jul 4 02:10:19 2022
%------------------------------------------------------------------------------