TSTP Solution File: NUN059+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUN059+1 : TPTP v8.1.0. Bugfixed v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 : Mon Jul 18 16:38:29 EDT 2022
% Result : Theorem 5.31s 5.51s
% Output : Refutation 5.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN059+1 : TPTP v8.1.0. Bugfixed v7.4.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.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 : Thu Jun 2 07:59:42 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 n026.cluster.edu,
% 0.12/0.36 Thu Jun 2 07:59:42 2022
% 0.12/0.36 The command was "./sos". The process ID is 28463.
% 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 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 45 back subsumes 36.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.47/0.65
% 0.47/0.65 Model 1 (0.00 seconds, 0 Inserts)
% 0.47/0.65
% 0.47/0.65 Stopped by limit on number of solutions
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 -------------- Softie stats --------------
% 0.47/0.65
% 0.47/0.65 UPDATE_STOP: 300
% 0.47/0.65 SFINDER_TIME_LIMIT: 2
% 0.47/0.65 SHORT_CLAUSE_CUTOFF: 4
% 0.47/0.65 number of clauses in intial UL: 43
% 0.47/0.65 number of clauses initially in problem: 65
% 0.47/0.65 percentage of clauses intially in UL: 66
% 0.47/0.65 percentage of distinct symbols occuring in initial UL: 36
% 0.47/0.65 percent of all initial clauses that are short: 100
% 0.47/0.65 absolute distinct symbol count: 25
% 0.47/0.65 distinct predicate count: 5
% 0.47/0.65 distinct function count: 19
% 0.47/0.65 distinct constant count: 1
% 0.47/0.65
% 0.47/0.65 ---------- no more Softie stats ----------
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 Stopped by limit on insertions
% 0.47/0.65
% 0.47/0.65 =========== start of search ===========
% 5.31/5.51
% 5.31/5.51 -------- PROOF --------
% 5.31/5.51 % SZS status Theorem
% 5.31/5.51 % SZS output start Refutation
% 5.31/5.51
% 5.31/5.51 Model 2 [ 1 1 292 ] (0.00 seconds, 29293 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 3 [ 1 0 489 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 4 [ 1 1 490 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 5 [ 1 1 2502 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Model 6 [ 2 1 1532 ] (0.00 seconds, 42511 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 7 [ 17 1 2654 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 8 [ 25 1 1257 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 9 [ 31 1 470 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 10 [ 54 1 240 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 11 [ 48 1 591 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 12 [ 35 1 1379 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 13 [ 64 1 383 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 14 [ 40 1 1072 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 15 [ 60 1 1316 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 16 [ 83 0 512 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 17 [ 66 1 248 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 18 [ 48 1 1691 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 19 [ 97 1 406 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 20 [ 63 2 71392 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 21 [ 74 1 244 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 22 [ 63 0 510 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 23 [ 78 1 758 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 24 [ 65 0 496 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 25 [ 88 1 245 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 26 [ 79 1 729 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 27 [ 91 1 258 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 Stopped by limit on insertions
% 5.31/5.51
% 5.31/5.51 Model 28 [ 95 1 857 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 -----> EMPTY CLAUSE at 5.11 sec ----> 4729 [hyper,4452,44,286,2482] {-} $F.
% 5.31/5.51
% 5.31/5.51 Length of proof is 9. Level of proof is 3.
% 5.31/5.51
% 5.31/5.51 ---------------- PROOF ----------------
% 5.31/5.51 % SZS status Theorem
% 5.31/5.51 % SZS output start Refutation
% 5.31/5.51
% 5.31/5.51 1 [] {+} id(A,$c1)| -r1(A).
% 5.31/5.51 10 [] {+} -id(A,B)|id(A,C)| -id(B,C).
% 5.31/5.51 12 [] {+} -id(A,B)| -r1(B)|r1(A).
% 5.31/5.51 15 [] {+} -id(A,B)| -id(C,D)| -id(E,F)| -r3(A,C,E)|r3(B,D,F).
% 5.31/5.51 17 [] {+} -id(A,B)| -id(C,D)| -id(E,F)| -r4(A,C,E)|r4(B,D,F).
% 5.31/5.51 21 [] {+} -id(A,B)| -r4(C,C,B)| -r4(D,D,E)| -r4(F,F,G)| -r3(G,E,A).
% 5.31/5.51 37 [factor,21.2.3] {+} -id(A,B)| -r4(C,C,B)| -r4(D,D,E)| -r3(E,B,A).
% 5.31/5.51 44 [factor,37.2.3] {+} -id(A,B)| -r4(C,C,B)| -r3(B,B,A).
% 5.31/5.51 56 [] {-} id($f13(A),A).
% 5.31/5.51 57 [] {+} r1($f12(A)).
% 5.31/5.51 58 [] {+} r3(A,$f12(A),$f13(A)).
% 5.31/5.51 59 [] {+} r1($f14(A)).
% 5.31/5.51 60 [] {+} r4(A,$f14(A),$f16(A)).
% 5.31/5.51 61 [] {+} id($f16(A),$f15(A)).
% 5.31/5.51 62 [] {+} r1($f15(A)).
% 5.31/5.51 71 [hyper,57,1] {+} id($f12(A),$c1).
% 5.31/5.51 72 [hyper,59,1] {+} id($f14(A),$c1).
% 5.31/5.51 79 [hyper,56,10,56] {-} id($f13($f13(A)),A).
% 5.31/5.51 143 [hyper,61,12,62] {+} r1($f16(A)).
% 5.31/5.51 286 [hyper,143,1] {+} id($f16(A),$c1).
% 5.31/5.51 2482 [hyper,58,15,286,71,56] {+} r3($c1,$c1,$f16(A)).
% 5.31/5.51 4452 [hyper,60,17,79,72,286] {+} r4(A,$c1,$c1).
% 5.31/5.51 4729 [hyper,4452,44,286,2482] {-} $F.
% 5.31/5.51
% 5.31/5.51 % SZS output end Refutation
% 5.31/5.51 ------------ end of proof -------------
% 5.31/5.51
% 5.31/5.51
% 5.31/5.51 Search stopped by max_proofs option.
% 5.31/5.51
% 5.31/5.51
% 5.31/5.51 Search stopped by max_proofs option.
% 5.31/5.51
% 5.31/5.51 ============ end of search ============
% 5.31/5.51
% 5.31/5.51 ----------- soft-scott stats ----------
% 5.31/5.51
% 5.31/5.51 true clauses given 7 (14.6%)
% 5.31/5.51 false clauses given 41
% 5.31/5.51
% 5.31/5.51 FALSE TRUE
% 5.31/5.51 4 0 1
% 5.31/5.51 5 18 34
% 5.31/5.51 6 157 53
% 5.31/5.51 7 328 58
% 5.31/5.51 8 454 159
% 5.31/5.51 9 514 222
% 5.31/5.51 10 473 214
% 5.31/5.51 11 454 146
% 5.31/5.51 12 337 87
% 5.31/5.51 13 230 73
% 5.31/5.51 14 118 34
% 5.31/5.51 15 61 13
% 5.31/5.51 16 59 10
% 5.31/5.51 17 16 8
% 5.31/5.51 18 8 4
% 5.31/5.51 tot: 3227 1116 (25.7% true)
% 5.31/5.51
% 5.31/5.51
% 5.31/5.51 Model 28 [ 95 1 857 ] (0.00 seconds, 250000 Inserts)
% 5.31/5.51
% 5.31/5.51 That finishes the proof of the theorem.
% 5.31/5.51
% 5.31/5.51 Process 28463 finished Thu Jun 2 07:59:47 2022
%------------------------------------------------------------------------------