TSTP Solution File: LCL650+1.001 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:31:28 EDT 2022
% Result : Theorem 0.99s 1.19s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 10:46:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n027.cluster.edu,
% 0.18/0.35 Sun Jul 3 10:46:24 2022
% 0.18/0.35 The command was "./sos". The process ID is 1944.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 formula_list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.18/0.35
% 0.18/0.35 This is a non-Horn set without equality. The strategy
% 0.18/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.18/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.41
% 0.18/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 -------------- Softie stats --------------
% 0.18/0.41
% 0.18/0.41 UPDATE_STOP: 300
% 0.18/0.41 SFINDER_TIME_LIMIT: 2
% 0.18/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.41 number of clauses in intial UL: 74
% 0.18/0.41 number of clauses initially in problem: 84
% 0.18/0.41 percentage of clauses intially in UL: 88
% 0.18/0.41 percentage of distinct symbols occuring in initial UL: 55
% 0.18/0.41 percent of all initial clauses that are short: 100
% 0.18/0.41 absolute distinct symbol count: 20
% 0.18/0.41 distinct predicate count: 8
% 0.18/0.41 distinct function count: 2
% 0.18/0.41 distinct constant count: 10
% 0.18/0.41
% 0.18/0.41 ---------- no more Softie stats ----------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 =========== start of search ===========
% 0.99/1.19
% 0.99/1.19 -------- PROOF --------
% 0.99/1.19 % SZS status Theorem
% 0.99/1.19 % SZS output start Refutation
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 2 [ 1 1 717 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 3 [ 1 1 78 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 4 [ 3 0 491 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 5 [ 3 1 84 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 6 [ 3 1 725 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 7 [ 3 0 62 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 8 [ 3 0 115 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 Stopped by limit on insertions
% 0.99/1.19
% 0.99/1.19 Model 9 [ 3 0 73 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 -----> EMPTY CLAUSE at 0.81 sec ----> 101 [hyper,100,11,75,76,77,78,99] {-} $F.
% 0.99/1.19
% 0.99/1.19 Length of proof is 5. Level of proof is 3.
% 0.99/1.19
% 0.99/1.19 ---------------- PROOF ----------------
% 0.99/1.19 % SZS status Theorem
% 0.99/1.19 % SZS output start Refutation
% 0.99/1.19
% 0.99/1.19 2 [] {+} -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)|p3(D)|p1(D).
% 0.99/1.19 3 [] {+} -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -p1(D)| -p3(D).
% 0.99/1.19 6 [] {+} -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)|p2(D)|p3(D).
% 0.99/1.19 7 [] {+} -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -p3(D)| -p2(D).
% 0.99/1.19 10 [] {+} -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)|p1(D)|p2(D).
% 0.99/1.19 11 [] {+} -r1($c10,A)| -r1(A,B)| -r1(B,C)| -r1(C,D)| -p2(D)| -p1(D).
% 0.99/1.19 75 [] {-} r1($c10,$c4).
% 0.99/1.19 76 [] {+} r1($c4,$c3).
% 0.99/1.19 77 [] {+} r1($c3,$c2).
% 0.99/1.19 78 [] {+} r1($c2,$c1).
% 0.99/1.19 89 [hyper,78,10,75,76,77] {+} p1($c1)|p2($c1).
% 0.99/1.19 90 [hyper,78,6,75,76,77] {+} p2($c1)|p3($c1).
% 0.99/1.19 91 [hyper,78,2,75,76,77] {+} p3($c1)|p1($c1).
% 0.99/1.19 99 [hyper,91,7,75,76,77,78,89,factor_simp] {+} p1($c1).
% 0.99/1.19 100 [hyper,99,3,75,76,77,78,90] {+} p2($c1).
% 0.99/1.19 101 [hyper,100,11,75,76,77,78,99] {-} $F.
% 0.99/1.19
% 0.99/1.19 % SZS output end Refutation
% 0.99/1.19 ------------ end of proof -------------
% 0.99/1.19
% 0.99/1.19
% 0.99/1.19 Search stopped by max_proofs option.
% 0.99/1.19
% 0.99/1.19
% 0.99/1.19 Search stopped by max_proofs option.
% 0.99/1.19
% 0.99/1.19 ============ end of search ============
% 0.99/1.19
% 0.99/1.19 ----------- soft-scott stats ----------
% 0.99/1.19
% 0.99/1.19 true clauses given 9 (45.0%)
% 0.99/1.19 false clauses given 11
% 0.99/1.19
% 0.99/1.19 FALSE TRUE
% 0.99/1.19 4 0 2
% 0.99/1.19 5 0 1
% 0.99/1.19 7 0 3
% 0.99/1.19 tot: 0 6 (100.0% true)
% 0.99/1.19
% 0.99/1.19
% 0.99/1.19 Model 9 [ 3 0 73 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.19
% 0.99/1.19 That finishes the proof of the theorem.
% 0.99/1.19
% 0.99/1.19 Process 1944 finished Sun Jul 3 10:46:25 2022
%------------------------------------------------------------------------------