TSTP Solution File: NUN067+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUN067+1 : TPTP v8.1.0. Released v7.3.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:30 EDT 2022
% Result : Theorem 0.91s 1.14s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN067+1 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n026.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 : Thu Jun 2 08:16: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 sandbox on n026.cluster.edu,
% 0.12/0.36 Thu Jun 2 08:16:42 2022
% 0.12/0.36 The command was "./sos". The process ID is 14430.
% 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 40 back subsumes 35.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.45/0.66
% 0.45/0.66 Model 1 (0.00 seconds, 0 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on number of solutions
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 -------------- Softie stats --------------
% 0.45/0.66
% 0.45/0.66 UPDATE_STOP: 300
% 0.45/0.66 SFINDER_TIME_LIMIT: 2
% 0.45/0.66 SHORT_CLAUSE_CUTOFF: 4
% 0.45/0.66 number of clauses in intial UL: 38
% 0.45/0.66 number of clauses initially in problem: 62
% 0.45/0.66 percentage of clauses intially in UL: 61
% 0.45/0.66 percentage of distinct symbols occuring in initial UL: 34
% 0.45/0.66 percent of all initial clauses that are short: 100
% 0.45/0.66 absolute distinct symbol count: 26
% 0.45/0.66 distinct predicate count: 5
% 0.45/0.66 distinct function count: 20
% 0.45/0.66 distinct constant count: 1
% 0.45/0.66
% 0.45/0.66 ---------- no more Softie stats ----------
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Stopped by limit on insertions
% 0.45/0.66
% 0.45/0.66 =========== start of search ===========
% 0.91/1.14
% 0.91/1.14 -------- PROOF --------
% 0.91/1.14 % SZS status Theorem
% 0.91/1.14 % SZS output start Refutation
% 0.91/1.14
% 0.91/1.14 Model 2 [ 1 0 254 ] (0.00 seconds, 689 Inserts)
% 0.91/1.14
% 0.91/1.14 Model 3 [ 1 0 395 ] (0.00 seconds, 844 Inserts)
% 0.91/1.14
% 0.91/1.14 Model 4 [ 1 1 484 ] (0.00 seconds, 945 Inserts)
% 0.91/1.14
% 0.91/1.14 Stopped by limit on insertions
% 0.91/1.14
% 0.91/1.14 Model 5 [ 1 1 255 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.14
% 0.91/1.14 Model 6 [ 1 1 4930 ] (0.00 seconds, 5406 Inserts)
% 0.91/1.14
% 0.91/1.14 Model 7 [ 1 0 632 ] (0.00 seconds, 1129 Inserts)
% 0.91/1.14
% 0.91/1.14 Model 8 [ 2 1 1416 ] (0.00 seconds, 2314 Inserts)
% 0.91/1.14
% 0.91/1.14 Stopped by limit on insertions
% 0.91/1.14
% 0.91/1.14 -----> EMPTY CLAUSE at 0.75 sec ----> 105 [hyper,85,20,51,42] {-} $F.
% 0.91/1.14
% 0.91/1.14 Length of proof is 1. Level of proof is 1.
% 0.91/1.14
% 0.91/1.14 ---------------- PROOF ----------------
% 0.91/1.14 % SZS status Theorem
% 0.91/1.14 % SZS output start Refutation
% 0.91/1.14
% 0.91/1.14 12 [] {+} -id(A,B)| -r1(B)|r1(A).
% 0.91/1.14 20 [] {+} -id(A,B)| -r1(A)| -r2(C,B).
% 0.91/1.14 42 [] {-} r2(A,$f4(B,A)).
% 0.91/1.14 51 [] {-} id($f13(A),A).
% 0.91/1.14 62 [] {-} id(A,$f20(A)).
% 0.91/1.14 63 [] {+} r1($f20(A)).
% 0.91/1.14 85 [hyper,62,12,63] {-} r1(A).
% 0.91/1.14 105 [hyper,85,20,51,42] {-} $F.
% 0.91/1.14
% 0.91/1.14 % SZS output end Refutation
% 0.91/1.14 ------------ end of proof -------------
% 0.91/1.14
% 0.91/1.14
% 0.91/1.14 Search stopped by max_proofs option.
% 0.91/1.14
% 0.91/1.14
% 0.91/1.14 Search stopped by max_proofs option.
% 0.91/1.14
% 0.91/1.14 ============ end of search ============
% 0.91/1.14
% 0.91/1.14 ----------- soft-scott stats ----------
% 0.91/1.14
% 0.91/1.14 true clauses given 0 (0.0%)
% 0.91/1.14 false clauses given 12
% 0.91/1.14
% 0.91/1.14 FALSE TRUE
% 0.91/1.14 4 3 4
% 0.91/1.14 5 6 0
% 0.91/1.14 6 13 0
% 0.91/1.14 7 8 1
% 0.91/1.14 8 5 1
% 0.91/1.14 9 3 0
% 0.91/1.14 10 2 0
% 0.91/1.14 tot: 40 6 (13.0% true)
% 0.91/1.14
% 0.91/1.14
% 0.91/1.14 Model 8 [ 2 -19 1416 ] (0.00 seconds, 2314 Inserts)
% 0.91/1.14
% 0.91/1.14 That finishes the proof of the theorem.
% 0.91/1.14
% 0.91/1.14 Process 14430 finished Thu Jun 2 08:16:43 2022
%------------------------------------------------------------------------------