TSTP Solution File: NUM016-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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.37s 0.57s
% Output : Refutation 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n008.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 : Wed Jul 6 16:30:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n008.cluster.edu,
% 0.12/0.35 Wed Jul 6 16:30:08 2022
% 0.12/0.35 The command was "./sos". The process ID is 18280.
% 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.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 4
% 0.19/0.39 number of clauses initially in problem: 8
% 0.19/0.39 percentage of clauses intially in UL: 50
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 83
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 6
% 0.19/0.39 distinct predicate count: 3
% 0.19/0.39 distinct function count: 2
% 0.19/0.39 distinct constant count: 1
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.37/0.57
% 0.37/0.57 -------- PROOF --------
% 0.37/0.57 % SZS status Unsatisfiable
% 0.37/0.57 % SZS output start Refutation
% 0.37/0.57
% 0.37/0.57 Model 3 (0.00 seconds, 0 Inserts)
% 0.37/0.57
% 0.37/0.57 Stopped by limit on number of solutions
% 0.37/0.57
% 0.37/0.57 Model 4 [ 1 0 78 ] (0.00 seconds, 422 Inserts)
% 0.37/0.57
% 0.37/0.57 Model 5 [ 1 1 66 ] (0.00 seconds, 551 Inserts)
% 0.37/0.57
% 0.37/0.57 Model 6 [ 2 0 159 ] (0.00 seconds, 6179 Inserts)
% 0.37/0.57
% 0.37/0.57 Model 7 [ 2 1 171 ] (0.00 seconds, 33494 Inserts)
% 0.37/0.57
% 0.37/0.57 Model 8 [ 2 2 28232 ] (0.00 seconds, 48739 Inserts)
% 0.37/0.57
% 0.37/0.57 Model 9 [ 3 0 1046 ] (0.00 seconds, 149950 Inserts)
% 0.37/0.57
% 0.37/0.57 -----> EMPTY CLAUSE at 0.19 sec ----> 14 [hyper,13,2,11] {-} $F.
% 0.37/0.57
% 0.37/0.57 Length of proof is 5. Level of proof is 3.
% 0.37/0.57
% 0.37/0.57 ---------------- PROOF ----------------
% 0.37/0.57 % SZS status Unsatisfiable
% 0.37/0.57 % SZS output start Refutation
% 0.37/0.57
% 0.37/0.57 1 [] {+} -less(A,A).
% 0.37/0.57 2 [] {+} -less(A,B)| -less(B,A).
% 0.37/0.57 3 [] {+} -divides(A,factorial_plus_one(B))|less(B,A).
% 0.37/0.57 4 [] {+} -prime(A)| -less(a,A)|less(factorial_plus_one(a),A).
% 0.37/0.57 5 [] {+} less(A,factorial_plus_one(A)).
% 0.37/0.57 6 [] {+} prime(A)|divides(prime_divisor(A),A).
% 0.37/0.57 7 [] {+} prime(A)|prime(prime_divisor(A)).
% 0.37/0.57 8 [] {+} prime(A)|less(prime_divisor(A),A).
% 0.37/0.57 9 [hyper,6,4,5,unit_del,1] {+} divides(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)).
% 0.37/0.57 10 [hyper,7,4,5,unit_del,1] {+} prime(prime_divisor(factorial_plus_one(a))).
% 0.37/0.57 11 [hyper,8,4,5,unit_del,1] {+} less(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)).
% 0.37/0.57 12 [hyper,9,3] {+} less(a,prime_divisor(factorial_plus_one(a))).
% 0.37/0.57 13 [hyper,12,4,10] {+} less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))).
% 0.37/0.57 14 [hyper,13,2,11] {-} $F.
% 0.37/0.57
% 0.37/0.57 % SZS output end Refutation
% 0.37/0.57 ------------ end of proof -------------
% 0.37/0.57
% 0.37/0.57
% 0.37/0.57 Search stopped by max_proofs option.
% 0.37/0.57
% 0.37/0.57
% 0.37/0.57 Search stopped by max_proofs option.
% 0.37/0.57
% 0.37/0.57 ============ end of search ============
% 0.37/0.57
% 0.37/0.57 ----------- soft-scott stats ----------
% 0.37/0.57
% 0.37/0.57 true clauses given 1 (11.1%)
% 0.37/0.57 false clauses given 8
% 0.37/0.57
% 0.37/0.57 FALSE TRUE
% 0.37/0.57 tot: 0 0 (-nan% true)
% 0.37/0.57
% 0.37/0.57
% 0.37/0.57 Model 9 [ 3 0 1046 ] (0.00 seconds, 149950 Inserts)
% 0.37/0.57
% 0.37/0.57 That finishes the proof of the theorem.
% 0.37/0.57
% 0.37/0.57 Process 18280 finished Wed Jul 6 16:30:08 2022
%------------------------------------------------------------------------------