%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM015-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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 1.05s 1.27s
% Output : Refutation 1.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n014.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 : Wed Jul 6 14:33:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n014.cluster.edu,
% 0.18/0.35 Wed Jul 6 14:33:22 2022
% 0.18/0.35 The command was "./sos". The process ID is 7908.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.18/0.35
% 0.18/0.35 This is a non-Horn set without equality. The strategy
% 0.18/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.18/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 4
% 0.18/0.38 number of clauses initially in problem: 9
% 0.18/0.38 percentage of clauses intially in UL: 44
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 85
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 7
% 0.18/0.38 distinct predicate count: 3
% 0.18/0.38 distinct function count: 2
% 0.18/0.38 distinct constant count: 2
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 1.05/1.27
% 1.05/1.27 -------- PROOF --------
% 1.05/1.27 % SZS status Unsatisfiable
% 1.05/1.27 % SZS output start Refutation
% 1.05/1.27
% 1.05/1.27 Model 3 (0.00 seconds, 0 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on number of solutions
% 1.05/1.27
% 1.05/1.27 Model 4 (0.00 seconds, 0 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on number of solutions
% 1.05/1.27
% 1.05/1.27 Model 5 (0.00 seconds, 0 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on number of solutions
% 1.05/1.27
% 1.05/1.27 Stopped by limit on insertions
% 1.05/1.27
% 1.05/1.27 Model 6 [ 1 1 1056 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on insertions
% 1.05/1.27
% 1.05/1.27 Model 7 [ 1 0 1273 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on insertions
% 1.05/1.27
% 1.05/1.27 Model 8 [ 1 1 11095 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on insertions
% 1.05/1.27
% 1.05/1.27 Model 9 [ 1 6 175309 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on insertions
% 1.05/1.27
% 1.05/1.27 Model 10 [ 2 1 10756 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on insertions
% 1.05/1.27
% 1.05/1.27 Model 11 [ 2 0 3386 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 Stopped by limit on insertions
% 1.05/1.27
% 1.05/1.27 Model 12 [ 2 2 40982 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 -----> EMPTY CLAUSE at 0.90 sec ----> 19 [hyper,18,4,14] {-} $F.
% 1.05/1.27
% 1.05/1.27 Length of proof is 6. Level of proof is 3.
% 1.05/1.27
% 1.05/1.27 ---------------- PROOF ----------------
% 1.05/1.27 % SZS status Unsatisfiable
% 1.05/1.27 % SZS output start Refutation
% 1.05/1.27
% 1.05/1.27 1 [] {+} -divides(A,B)| -divides(B,C)|divides(A,C).
% 1.05/1.27 2 [] {+} -less(n1,A)| -less(A,a)|prime(factor_of(A)).
% 1.05/1.27 3 [] {+} -less(n1,A)| -less(A,a)|divides(factor_of(A),A).
% 1.05/1.27 4 [] {+} -prime(A)| -divides(A,a).
% 1.05/1.27 5 [] {+} divides(A,A).
% 1.05/1.27 6 [] {+} prime(A)|divides(divisor(A),A).
% 1.05/1.27 7 [] {+} prime(A)|less(n1,divisor(A)).
% 1.05/1.27 8 [] {+} prime(A)|less(divisor(A),A).
% 1.05/1.27 10 [hyper,7,4,5] {+} less(n1,divisor(a)).
% 1.05/1.27 11 [hyper,8,4,5] {+} less(divisor(a),a).
% 1.05/1.27 12 [hyper,6,4,5] {+} divides(divisor(a),a).
% 1.05/1.27 13 [hyper,11,3,10] {+} divides(factor_of(divisor(a)),divisor(a)).
% 1.05/1.27 14 [hyper,11,2,10] {+} prime(factor_of(divisor(a))).
% 1.05/1.27 18 [hyper,13,1,12] {+} divides(factor_of(divisor(a)),a).
% 1.05/1.27 19 [hyper,18,4,14] {-} $F.
% 1.05/1.27
% 1.05/1.27 % SZS output end Refutation
% 1.05/1.27 ------------ end of proof -------------
% 1.05/1.27
% 1.05/1.27
% 1.05/1.27 Search stopped by max_proofs option.
% 1.05/1.27
% 1.05/1.27
% 1.05/1.27 Search stopped by max_proofs option.
% 1.05/1.27
% 1.05/1.27 ============ end of search ============
% 1.05/1.27
% 1.05/1.27 ----------- soft-scott stats ----------
% 1.05/1.27
% 1.05/1.27 true clauses given 1 (8.3%)
% 1.05/1.27 false clauses given 11
% 1.05/1.27
% 1.05/1.27 FALSE TRUE
% 1.05/1.27 5 0 1
% 1.05/1.27 6 0 1
% 1.05/1.27 tot: 0 2 (100.0% true)
% 1.05/1.27
% 1.05/1.27
% 1.05/1.27 Model 12 [ 2 2 40982 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.27
% 1.05/1.27 That finishes the proof of the theorem.
% 1.05/1.27
% 1.05/1.27 Process 7908 finished Wed Jul 6 14:33:23 2022
%------------------------------------------------------------------------------