TSTP Solution File: LCL686+1.005 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL686+1.005 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:32:16 EDT 2022
% Result : Theorem 2.40s 2.59s
% Output : Refutation 2.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL686+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n004.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:37:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n004.cluster.edu,
% 0.13/0.37 Mon Jul 4 10:37:23 2022
% 0.13/0.37 The command was "./sos". The process ID is 14440.
% 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 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.13/0.37
% 0.13/0.37 This is a non-Horn set without equality. The strategy
% 0.13/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.44/0.62
% 0.44/0.62 Model 1 (0.00 seconds, 0 Inserts)
% 0.44/0.62
% 0.44/0.62 Stopped by limit on number of solutions
% 0.44/0.62
% 0.44/0.62
% 0.44/0.62 -------------- Softie stats --------------
% 0.44/0.62
% 0.44/0.62 UPDATE_STOP: 300
% 0.44/0.62 SFINDER_TIME_LIMIT: 2
% 0.44/0.62 SHORT_CLAUSE_CUTOFF: 4
% 0.44/0.62 number of clauses in intial UL: 71
% 0.44/0.62 number of clauses initially in problem: 77
% 0.44/0.62 percentage of clauses intially in UL: 92
% 0.44/0.62 percentage of distinct symbols occuring in initial UL: 91
% 0.44/0.62 percent of all initial clauses that are short: 100
% 0.44/0.62 absolute distinct symbol count: 35
% 0.44/0.62 distinct predicate count: 16
% 0.44/0.62 distinct function count: 15
% 0.44/0.62 distinct constant count: 4
% 0.44/0.62
% 0.44/0.62 ---------- no more Softie stats ----------
% 0.44/0.62
% 0.44/0.62
% 0.44/0.62
% 0.44/0.62 Stopped by limit on insertions
% 0.44/0.62
% 0.44/0.62 =========== start of search ===========
% 2.40/2.59
% 2.40/2.59 -------- PROOF --------
% 2.40/2.59 % SZS status Theorem
% 2.40/2.59 % SZS output start Refutation
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 2 [ 1 2 17984 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 3 [ 1 2 19673 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 4 [ 2 2 18921 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 5 [ 4 1 18292 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 6 [ 6 1 17350 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 -----> EMPTY CLAUSE at 2.19 sec ----> 196 [hyper,195,69,72,194] {-} $F.
% 2.40/2.59
% 2.40/2.59 Length of proof is 4. Level of proof is 3.
% 2.40/2.59
% 2.40/2.59 ---------------- PROOF ----------------
% 2.40/2.59 % SZS status Theorem
% 2.40/2.59 % SZS output start Refutation
% 2.40/2.59
% 2.40/2.59 39 [] {+} -r1($c3,A)| -r1(A,B)| -p2(B)|p1(B).
% 2.40/2.59 40 [] {+} -r1($c3,A)| -r1(A,B)|p2(B)| -p1(B).
% 2.40/2.59 43 [] {+} -r1($c3,A)|r1(A,$f15(A)).
% 2.40/2.59 68 [] {+} -r1($c3,A)|p1($f15(A))|p2($f15(A)).
% 2.40/2.59 69 [] {+} -r1($c3,A)| -p2($f15(A))| -p1($f15(A)).
% 2.40/2.59 72 [] {-} r1(A,A).
% 2.40/2.59 78 [hyper,72,68] {+} p1($f15($c3))|p2($f15($c3)).
% 2.40/2.59 91 [hyper,72,43] {-} r1($c3,$f15($c3)).
% 2.40/2.59 194 [hyper,78,39,91,72,factor_simp] {+} p1($f15($c3)).
% 2.40/2.59 195 [hyper,194,40,91,72] {+} p2($f15($c3)).
% 2.40/2.59 196 [hyper,195,69,72,194] {-} $F.
% 2.40/2.59
% 2.40/2.59 % SZS output end Refutation
% 2.40/2.59 ------------ end of proof -------------
% 2.40/2.59
% 2.40/2.59
% 2.40/2.59 Search stopped by max_proofs option.
% 2.40/2.59
% 2.40/2.59
% 2.40/2.59 Search stopped by max_proofs option.
% 2.40/2.59
% 2.40/2.59 ============ end of search ============
% 2.40/2.59
% 2.40/2.59 ----------- soft-scott stats ----------
% 2.40/2.59
% 2.40/2.59 true clauses given 2 (14.3%)
% 2.40/2.59 false clauses given 12
% 2.40/2.59
% 2.40/2.59 FALSE TRUE
% 2.40/2.59 4 0 3
% 2.40/2.59 5 1 0
% 2.40/2.59 6 3 18
% 2.40/2.59 7 1 3
% 2.40/2.59 8 13 30
% 2.40/2.59 9 4 0
% 2.40/2.59 10 3 1
% 2.40/2.59 11 3 1
% 2.40/2.59 12 1 3
% 2.40/2.59 13 1 3
% 2.40/2.59 14 4 0
% 2.40/2.59 15 4 0
% 2.40/2.59 16 4 0
% 2.40/2.59 17 3 0
% 2.40/2.59 18 3 0
% 2.40/2.59 tot: 48 62 (56.4% true)
% 2.40/2.59
% 2.40/2.59
% 2.40/2.59 Model 6 [ 6 1 17350 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 That finishes the proof of the theorem.
% 2.40/2.59
% 2.40/2.59 Process 14440 finished Mon Jul 4 10:37:25 2022
%------------------------------------------------------------------------------