%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM016-2 : 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 : n003.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:15 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 8 unt; 7 nHn; 17 RR)
% Number of literals : 48 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(numbers_are_different,axiom,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',numbers_are_different) ).
cnf(prove_there_is_another_prime,negated_conjecture,
( ~ less(a,X1)
| ~ prime(X1)
| less(factorial_plus_one(a),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_another_prime) ).
cnf(nothing_is_less_than_itself,axiom,
~ less(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nothing_is_less_than_itself) ).
cnf(a_prime_is_less_than_the_next_one,axiom,
less(X1,factorial_plus_one(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_prime_is_less_than_the_next_one) ).
cnf(smaller_prime_divisors,axiom,
( less(prime_divisor(X1),X1)
| prime(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',smaller_prime_divisors) ).
cnf(divisor_is_smaller,axiom,
( ~ divides(X1,factorial_plus_one(X2))
| less(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divisor_is_smaller) ).
cnf(prime_divsiors,axiom,
( prime(prime_divisor(X1))
| prime(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prime_divsiors) ).
cnf(division_by_prime_divisor,axiom,
( divides(prime_divisor(X1),X1)
| prime(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',division_by_prime_divisor) ).
cnf(c_0_8,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(fof_simplification,[status(thm)],[numbers_are_different]) ).
cnf(c_0_9,negated_conjecture,
( ~ less(a,X1)
| ~ prime(X1)
| less(factorial_plus_one(a),X1) ),
inference(fof_simplification,[status(thm)],[prove_there_is_another_prime]) ).
cnf(c_0_10,plain,
~ less(X1,X1),
inference(fof_simplification,[status(thm)],[nothing_is_less_than_itself]) ).
cnf(c_0_11,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
( ~ less(a,X1)
| ~ prime(X1)
| less(factorial_plus_one(a),X1) ),
c_0_9 ).
cnf(c_0_13,plain,
~ less(X1,X1),
c_0_10 ).
cnf(c_0_14,axiom,
less(X1,factorial_plus_one(X1)),
a_prime_is_less_than_the_next_one ).
cnf(c_0_15,negated_conjecture,
( ~ less(a,X1)
| ~ less(X1,factorial_plus_one(a))
| ~ prime(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
( less(prime_divisor(X1),X1)
| prime(X1) ),
smaller_prime_divisors ).
cnf(c_0_17,negated_conjecture,
~ prime(factorial_plus_one(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_14])]) ).
cnf(c_0_18,plain,
( ~ divides(X1,factorial_plus_one(X2))
| less(X2,X1) ),
inference(fof_simplification,[status(thm)],[divisor_is_smaller]) ).
cnf(c_0_19,negated_conjecture,
( ~ less(a,prime_divisor(factorial_plus_one(a)))
| ~ prime(prime_divisor(factorial_plus_one(a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,axiom,
( prime(prime_divisor(X1))
| prime(X1) ),
prime_divsiors ).
cnf(c_0_21,plain,
( ~ divides(X1,factorial_plus_one(X2))
| less(X2,X1) ),
c_0_18 ).
cnf(c_0_22,axiom,
( divides(prime_divisor(X1),X1)
| prime(X1) ),
division_by_prime_divisor ).
cnf(c_0_23,negated_conjecture,
~ less(a,prime_divisor(factorial_plus_one(a))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]) ).
cnf(c_0_24,plain,
( less(X1,prime_divisor(factorial_plus_one(X1)))
| prime(factorial_plus_one(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM016-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n003.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 02:00:15 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % new_bool_3 with pid 3170065 completed with status 0
% 0.12/0.44 % Result found by new_bool_3
% 0.12/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 3170071 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Unsatisfiable
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 8
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 8
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 8
% 0.12/0.44 % Processed clauses : 19
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 3
% 0.12/0.44 % ...remaining for further processing : 16
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 1
% 0.12/0.44 % Backward-rewritten : 0
% 0.12/0.44 % Generated clauses : 13
% 0.12/0.44 % ...of the previous two non-redundant : 12
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 13
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 2
% 0.12/0.44 % ...of those cached : 1
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 15
% 0.12/0.44 % Positive orientable unit clauses : 1
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 4
% 0.12/0.44 % Non-unit-clauses : 10
% 0.12/0.44 % Current number of unprocessed clauses: 1
% 0.12/0.44 % ...number of literals in the above : 3
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 1
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 14
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 14
% 0.12/0.44 % Non-unit clause-clause subsumptions : 0
% 0.12/0.44 % Unit Clause-clause subsumption calls : 2
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 0
% 0.12/0.44 % BW rewrite match successes : 0
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 349
% 0.12/0.44 % Search garbage collected termcells : 14
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.003 s
% 0.12/0.44 % System time : 0.001 s
% 0.12/0.44 % Total time : 0.004 s
% 0.12/0.44 % Maximum resident set size: 3632 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.006 s
% 0.12/0.44 % System time : 0.004 s
% 0.12/0.44 % Total time : 0.010 s
% 0.12/0.44 % Maximum resident set size: 4864 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------