TSTP Solution File: NUM016-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 14:15:47 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 : Tue Jul 5 20:54:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n025.cluster.edu,
% 0.12/0.35 Tue Jul 5 20:54:12 2022
% 0.12/0.35 The command was "./sos". The process ID is 24877.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 6
% 0.12/0.39 number of clauses initially in problem: 12
% 0.12/0.39 percentage of clauses intially in UL: 50
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 83
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 6
% 0.12/0.39 distinct predicate count: 3
% 0.12/0.39 distinct function count: 2
% 0.12/0.39 distinct constant count: 1
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.19/0.48
% 0.19/0.48 -------- PROOF --------
% 0.19/0.48 % SZS status Unsatisfiable
% 0.19/0.48 % SZS output start Refutation
% 0.19/0.48
% 0.19/0.48 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48 Model 5 [ 1 0 42 ] (0.00 seconds, 2448 Inserts)
% 0.19/0.48
% 0.19/0.48 Model 6 [ 1 0 169 ] (0.00 seconds, 219 Inserts)
% 0.19/0.48
% 0.19/0.48 Model 7 [ 1 1 138 ] (0.00 seconds, 247 Inserts)
% 0.19/0.48
% 0.19/0.48 Model 8 [ 2 0 149 ] (0.00 seconds, 938 Inserts)
% 0.19/0.48
% 0.19/0.48 Model 9 [ 2 0 972 ] (0.00 seconds, 1537 Inserts)
% 0.19/0.48
% 0.19/0.48 Model 10 [ 3 1 147 ] (0.00 seconds, 3050 Inserts)
% 0.19/0.48
% 0.19/0.48 Model 11 [ 3 1 2358 ] (0.00 seconds, 5121 Inserts)
% 0.19/0.48
% 0.19/0.48 Model 12 [ 4 2 5629 ] (0.00 seconds, 15837 Inserts)
% 0.19/0.48
% 0.19/0.48 -----> EMPTY CLAUSE at 0.10 sec ----> 18 [hyper,17,4,14] {-} $F.
% 0.19/0.48
% 0.19/0.48 Length of proof is 4. Level of proof is 3.
% 0.19/0.48
% 0.19/0.48 ---------------- PROOF ----------------
% 0.19/0.48 % SZS status Unsatisfiable
% 0.19/0.48 % SZS output start Refutation
% 0.19/0.48
% 0.19/0.48 1 [] {+} -less(A,A).
% 0.19/0.48 4 [] {+} -divides(A,B)| -less(B,A).
% 0.19/0.48 5 [] {+} -divides(A,factorial_plus_one(B))|less(B,A).
% 0.19/0.48 6 [] {+} -prime(A)| -less(a,A)|less(factorial_plus_one(a),A).
% 0.19/0.48 8 [] {+} less(A,factorial_plus_one(A)).
% 0.19/0.48 9 [] {+} prime(A)|divides(prime_divisor(A),A).
% 0.19/0.48 10 [] {+} prime(A)|prime(prime_divisor(A)).
% 0.19/0.48 13 [hyper,8,6,10,unit_del,1] {+} prime(prime_divisor(factorial_plus_one(a))).
% 0.19/0.48 14 [hyper,8,6,9,unit_del,1] {+} divides(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)).
% 0.19/0.48 16 [hyper,14,5] {+} less(a,prime_divisor(factorial_plus_one(a))).
% 0.19/0.48 17 [hyper,16,6,13] {+} less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))).
% 0.19/0.48 18 [hyper,17,4,14] {-} $F.
% 0.19/0.48
% 0.19/0.48 % SZS output end Refutation
% 0.19/0.48 ------------ end of proof -------------
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Search stopped by max_proofs option.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Search stopped by max_proofs option.
% 0.19/0.48
% 0.19/0.48 ============ end of search ============
% 0.19/0.48
% 0.19/0.48 ----------- soft-scott stats ----------
% 0.19/0.48
% 0.19/0.48 true clauses given 0 (0.0%)
% 0.19/0.48 false clauses given 11
% 0.19/0.48
% 0.19/0.48 FALSE TRUE
% 0.19/0.48 tot: 0 0 (-nan% true)
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Model 12 [ 4 2 5629 ] (0.00 seconds, 15837 Inserts)
% 0.19/0.48
% 0.19/0.48 That finishes the proof of the theorem.
% 0.19/0.48
% 0.19/0.48 Process 24877 finished Tue Jul 5 20:54:12 2022
%------------------------------------------------------------------------------