%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM015-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:44:14 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.34s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 4 unt; 8 nHn; 17 RR)
% Number of literals : 58 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitive_divide,axiom,
( ~ divides(X2,X3)
| ~ divides(X1,X2)
| divides(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive_divide) ).
cnf(prove_a_has_prime_divisor,negated_conjecture,
( ~ divides(X1,a)
| ~ prime(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_has_prime_divisor) ).
cnf(factor1,axiom,
( ~ less(X1,a)
| ~ less(n1,X1)
| prime(factor_of(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',factor1) ).
cnf(prime,axiom,
( divides(divisor(X1),X1)
| prime(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prime) ).
cnf(factor2,axiom,
( ~ less(X1,a)
| ~ less(n1,X1)
| divides(factor_of(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',factor2) ).
cnf(divisor1,axiom,
( less(n1,divisor(X1))
| prime(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divisor1) ).
cnf(divisor2,axiom,
( less(divisor(X1),X1)
| prime(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divisor2) ).
cnf(divide_self,axiom,
divides(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divide_self) ).
cnf(c_0_8,plain,
( ~ divides(X2,X3)
| ~ divides(X1,X2)
| divides(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitive_divide]) ).
cnf(c_0_9,negated_conjecture,
( ~ divides(X1,a)
| ~ prime(X1) ),
inference(fof_simplification,[status(thm)],[prove_a_has_prime_divisor]) ).
cnf(c_0_10,plain,
( ~ less(X1,a)
| ~ less(n1,X1)
| prime(factor_of(X1)) ),
inference(fof_simplification,[status(thm)],[factor1]) ).
cnf(c_0_11,plain,
( ~ divides(X2,X3)
| ~ divides(X1,X2)
| divides(X1,X3) ),
c_0_8 ).
cnf(c_0_12,axiom,
( divides(divisor(X1),X1)
| prime(X1) ),
prime ).
cnf(c_0_13,plain,
( ~ less(X1,a)
| ~ less(n1,X1)
| divides(factor_of(X1),X1) ),
inference(fof_simplification,[status(thm)],[factor2]) ).
cnf(c_0_14,negated_conjecture,
( ~ divides(X1,a)
| ~ prime(X1) ),
c_0_9 ).
cnf(c_0_15,plain,
( ~ less(X1,a)
| ~ less(n1,X1)
| prime(factor_of(X1)) ),
c_0_10 ).
cnf(c_0_16,plain,
( ~ divides(X2,divisor(X1))
| divides(X2,X1)
| prime(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ less(X1,a)
| ~ less(n1,X1)
| divides(factor_of(X1),X1) ),
c_0_13 ).
cnf(c_0_18,axiom,
( less(n1,divisor(X1))
| prime(X1) ),
divisor1 ).
cnf(c_0_19,negated_conjecture,
( ~ divides(factor_of(X1),a)
| ~ less(n1,X1)
| ~ less(X1,a) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ less(divisor(X1),a)
| divides(factor_of(divisor(X1)),X1)
| prime(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,axiom,
( less(divisor(X1),X1)
| prime(X1) ),
divisor2 ).
cnf(c_0_22,negated_conjecture,
prime(a),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]),c_0_21]) ).
cnf(c_0_23,axiom,
divides(X1,X1),
divide_self ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM015-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Mon Sep 21 01:58:21 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.33 Running first-order theorem proving
% 0.03/0.33 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Version: 3.5.1
% 0.08/0.34 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.34 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.34 % Starting sh5l with 300s (1) cores
% 0.08/0.34 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1350528 completed with status 0
% 0.08/0.34 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.34 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.34 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.34 % No SInE strategy applied
% 0.08/0.34 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.08/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.34 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.34 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.08/0.34 % Starting new_bool_3 with 136s (1) cores
% 0.08/0.34 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.34 % SubtermCWHack with pid 1350532 completed with status 0
% 0.08/0.34 % Result found by SubtermCWHack
% 0.08/0.34 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.34 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.34 % No SInE strategy applied
% 0.08/0.34 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.08/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.34 % Preprocessing time : 0.001 s
% 0.08/0.34
% 0.08/0.34 % Proof found!
% 0.08/0.34 % SZS status Unsatisfiable
% 0.08/0.34 % SZS output start CNFRefutation
% See solution above
% 0.08/0.34 % Parsed axioms : 9
% 0.08/0.34 % Removed by relevancy pruning/SinE : 0
% 0.08/0.34 % Initial clauses : 9
% 0.08/0.34 % Removed in clause preprocessing : 0
% 0.08/0.34 % Initial clauses in saturation : 9
% 0.08/0.34 % Processed clauses : 21
% 0.08/0.34 % ...of these trivial : 0
% 0.08/0.34 % ...subsumed : 4
% 0.08/0.34 % ...remaining for further processing : 17
% 0.08/0.34 % Other redundant clauses eliminated : 0
% 0.08/0.34 % Clauses deleted for lack of memory : 0
% 0.08/0.34 % Backward-subsumed : 0
% 0.08/0.34 % Backward-rewritten : 0
% 0.08/0.34 % Generated clauses : 24
% 0.08/0.34 % ...of the previous two non-redundant : 22
% 0.08/0.34 % ...aggressively subsumed : 0
% 0.08/0.34 % Contextual simplify-reflections : 3
% 0.08/0.34 % Paramodulations : 24
% 0.08/0.34 % Factorizations : 0
% 0.08/0.34 % NegExts : 0
% 0.08/0.34 % Equation resolutions : 0
% 0.08/0.34 % Disequality decompositions : 0
% 0.08/0.34 % Total rewrite steps : 2
% 0.08/0.34 % ...of those cached : 0
% 0.08/0.34 % Propositional unsat checks : 0
% 0.08/0.34 % Propositional check models : 0
% 0.08/0.34 % Propositional check unsatisfiable : 0
% 0.08/0.34 % Propositional clauses : 0
% 0.08/0.34 % Propositional clauses after purity: 0
% 0.08/0.34 % Propositional unsat core size : 0
% 0.08/0.34 % Propositional preprocessing time : 0.000
% 0.08/0.34 % Propositional encoding time : 0.000
% 0.08/0.34 % Propositional solver time : 0.000
% 0.08/0.34 % Success case prop preproc time : 0.000
% 0.08/0.34 % Success case prop encoding time : 0.000
% 0.08/0.34 % Success case prop solver time : 0.000
% 0.08/0.34 % Current number of processed clauses : 17
% 0.08/0.34 % Positive orientable unit clauses : 3
% 0.08/0.34 % Positive unorientable unit clauses: 0
% 0.08/0.34 % Negative unit clauses : 1
% 0.08/0.34 % Non-unit-clauses : 13
% 0.08/0.34 % Current number of unprocessed clauses: 10
% 0.08/0.34 % ...number of literals in the above : 46
% 0.08/0.34 % Current number of archived formulas : 0
% 0.08/0.34 % Current number of archived clauses : 0
% 0.08/0.34 % Clause-clause subsumption calls (NU) : 32
% 0.08/0.34 % Rec. Clause-clause subsumption calls : 22
% 0.08/0.34 % Non-unit clause-clause subsumptions : 7
% 0.08/0.34 % Unit Clause-clause subsumption calls : 1
% 0.08/0.34 % Rewrite failures with RHS unbound : 0
% 0.08/0.34 % BW rewrite match attempts : 0
% 0.08/0.34 % BW rewrite match successes : 0
% 0.08/0.34 % Condensation attempts : 0
% 0.08/0.34 % Condensation successes : 0
% 0.08/0.34 % Termbank termtop insertions : 655
% 0.08/0.34 % Search garbage collected termcells : 18
% 0.08/0.34
% 0.08/0.34 % -------------------------------------------------
% 0.08/0.34 % User time : 0.002 s
% 0.08/0.34 % System time : 0.002 s
% 0.08/0.34 % Total time : 0.003 s
% 0.08/0.34 % Maximum resident set size: 3632 pages
% 0.08/0.34
% 0.08/0.34 % -------------------------------------------------
% 0.08/0.34 % User time : 0.008 s
% 0.08/0.34 % System time : 0.009 s
% 0.08/0.34 % Total time : 0.017 s
% 0.08/0.34 % Maximum resident set size: 4608 pages
% 0.08/0.34 % E exiting
%------------------------------------------------------------------------------