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