%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM017-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 3.13s 0.90s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 50 ( 13 unt; 0 nHn; 39 RR)
% Number of literals : 108 ( 13 equ; 62 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 137 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_associativity2,axiom,
( ~ product(X6,X4,X1)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X5,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_associativity2) ).
cnf(product_divisible_by_operand,axiom,
( ~ product(X1,X2,X3)
| divides(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_divisible_by_operand) ).
cnf(closure_of_product,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_product) ).
cnf(primes_lemma1,axiom,
( ~ prime(X1)
| ~ product(X3,X3,X2)
| ~ divides(X1,X2)
| divides(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',primes_lemma1) ).
cnf(well_defined_product,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X4 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_defined_product) ).
cnf(product_commutativity,axiom,
( ~ product(X1,X2,X3)
| product(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_commutativity) ).
cnf(product_left_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| X2 = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(divides_implies_product,axiom,
( ~ divides(X1,X2)
| product(X1,second_divided_by_1st(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divides_implies_product) ).
cnf(prove_there_is_no_common_divisor,negated_conjecture,
( ~ divides(X1,b)
| ~ divides(X1,c) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_no_common_divisor) ).
cnf(a_is_prime,hypothesis,
prime(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_prime) ).
cnf(c_0_10,plain,
( ~ product(X6,X4,X1)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X5,X3) ),
inference(fof_simplification,[status(thm)],[product_associativity2]) ).
cnf(c_0_11,plain,
( ~ product(X1,X2,X3)
| divides(X1,X3) ),
inference(fof_simplification,[status(thm)],[product_divisible_by_operand]) ).
cnf(c_0_12,plain,
( ~ product(X6,X4,X1)
| ~ product(X4,X2,X5)
| ~ product(X1,X2,X3)
| product(X6,X5,X3) ),
c_0_10 ).
cnf(c_0_13,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_product ).
cnf(c_0_14,plain,
( ~ prime(X1)
| ~ product(X3,X3,X2)
| ~ divides(X1,X2)
| divides(X1,X3) ),
inference(fof_simplification,[status(thm)],[primes_lemma1]) ).
cnf(c_0_15,plain,
( ~ product(X1,X2,X3)
| divides(X1,X3) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X4 = X3 ),
inference(fof_simplification,[status(thm)],[well_defined_product]) ).
cnf(c_0_17,plain,
( ~ product(X4,X5,X2)
| ~ product(multiply(X1,X4),X5,X3)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ prime(X1)
| ~ product(X3,X3,X2)
| ~ divides(X1,X2)
| divides(X1,X3) ),
c_0_14 ).
cnf(c_0_19,plain,
divides(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,plain,
( ~ product(X1,X2,X3)
| product(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[product_commutativity]) ).
cnf(c_0_21,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| X2 = X4 ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_22,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X4 = X3 ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ product(multiply(X1,X2),X3,X4)
| product(X1,multiply(X2,X3),X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_24,plain,
( ~ divides(X1,X2)
| product(X1,second_divided_by_1st(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[divides_implies_product]) ).
cnf(c_0_25,plain,
( ~ product(X2,X2,multiply(X1,X3))
| ~ prime(X1)
| divides(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ product(X1,X2,X3)
| product(X2,X1,X3) ),
c_0_20 ).
cnf(c_0_27,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| X2 = X4 ),
c_0_21 ).
cnf(c_0_28,plain,
( ~ product(X2,X3,X1)
| X1 = multiply(X2,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_29,plain,
product(X1,multiply(X2,X3),multiply(multiply(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_30,plain,
( ~ divides(X1,X2)
| product(X1,second_divided_by_1st(X1,X2),X2) ),
c_0_24 ).
cnf(c_0_31,plain,
( ~ prime(X1)
| divides(X1,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_32,plain,
product(X1,X2,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_33,plain,
( ~ product(X3,X1,multiply(X3,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_34,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( ~ prime(X1)
| product(X1,second_divided_by_1st(X1,X1),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( ~ product(multiply(X1,X3),X2,X4)
| product(X1,multiply(X2,X3),X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_37,plain,
( ~ product(multiply(X3,X4),X1,multiply(X3,multiply(X4,X2)))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( ~ prime(X1)
| multiply(X1,second_divided_by_1st(X1,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_28,c_0_35]) ).
cnf(c_0_39,plain,
product(X1,multiply(X2,X3),multiply(multiply(X1,X3),X2)),
inference(spm,[status(thm)],[c_0_36,c_0_13]) ).
cnf(c_0_40,plain,
( ~ product(X3,X1,multiply(X3,multiply(second_divided_by_1st(X3,X3),X2)))
| ~ prime(X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
product(X1,multiply(X2,X3),multiply(X1,multiply(X3,X2))),
inference(rw,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( ~ divides(X1,b)
| ~ divides(X1,c) ),
inference(fof_simplification,[status(thm)],[prove_there_is_no_common_divisor]) ).
cnf(c_0_43,plain,
divides(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_44,plain,
( ~ prime(X2)
| multiply(X1,second_divided_by_1st(X2,X2)) = X1 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ divides(X1,b)
| ~ divides(X1,c) ),
c_0_42 ).
cnf(c_0_46,plain,
( ~ prime(X1)
| divides(second_divided_by_1st(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,hypothesis,
prime(a),
a_is_prime ).
cnf(c_0_48,negated_conjecture,
~ prime(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_47,c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM017-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n005.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 21 01:58:48 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 3.13/0.90 % Version: 3.5.1
% 3.13/0.90 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.13/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.90 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.13/0.90 % Starting new_bool_3 with 300s (1) cores
% 3.13/0.90 % Starting new_bool_1 with 300s (1) cores
% 3.13/0.90 % Starting sh5l with 300s (1) cores
% 3.13/0.90 % new_bool_3 with pid 2312764 completed with status 9
% 3.13/0.90 % new_bool_1 with pid 2312765 completed with status 9
% 3.13/0.90 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2312763 completed with status 0
% 3.13/0.90 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.13/0.90 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.13/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.90 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.13/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.13/0.90 % No SInE strategy applied
% 3.13/0.90 % Search class: FHHSF-FFSS22-SFFFFFNN
% 3.13/0.90 % partial match(1): FGHSF-FFSS22-SFFFFFNN
% 3.13/0.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.90 % Starting SubtermCWHack with 136s (1) cores
% 3.13/0.90 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.13/0.90 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 3.13/0.90 % Starting new_bool_3 with 136s (1) cores
% 3.13/0.90 % Starting new_bool_1 with 136s (1) cores
% 3.13/0.90 % new_bool_3 with pid 2312772 completed with status 0
% 3.13/0.90 % Result found by new_bool_3
% 3.13/0.90 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.13/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.90 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.13/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.13/0.90 % No SInE strategy applied
% 3.13/0.90 % Search class: FHHSF-FFSS22-SFFFFFNN
% 3.13/0.90 % partial match(1): FGHSF-FFSS22-SFFFFFNN
% 3.13/0.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.90 % Starting SubtermCWHack with 136s (1) cores
% 3.13/0.90 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.13/0.90 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 3.13/0.90 % Starting new_bool_3 with 136s (1) cores
% 3.13/0.90 % Preprocessing time : 0.001 s
% 3.13/0.90 % Presaturation interreduction done
% 3.13/0.90
% 3.13/0.90 % Proof found!
% 3.13/0.90 % SZS status Unsatisfiable
% 3.13/0.90 % SZS output start CNFRefutation
% See solution above
% 3.13/0.90 % Parsed axioms : 15
% 3.13/0.90 % Removed by relevancy pruning/SinE : 0
% 3.13/0.90 % Initial clauses : 15
% 3.13/0.90 % Removed in clause preprocessing : 0
% 3.13/0.90 % Initial clauses in saturation : 15
% 3.13/0.90 % Processed clauses : 3948
% 3.13/0.90 % ...of these trivial : 460
% 3.13/0.90 % ...subsumed : 2520
% 3.13/0.90 % ...remaining for further processing : 968
% 3.13/0.90 % Other redundant clauses eliminated : 0
% 3.13/0.90 % Clauses deleted for lack of memory : 0
% 3.13/0.90 % Backward-subsumed : 249
% 3.13/0.90 % Backward-rewritten : 235
% 3.13/0.90 % Generated clauses : 22047
% 3.13/0.90 % ...of the previous two non-redundant : 16581
% 3.13/0.90 % ...aggressively subsumed : 0
% 3.13/0.90 % Contextual simplify-reflections : 1
% 3.13/0.90 % Paramodulations : 22046
% 3.13/0.90 % Factorizations : 0
% 3.13/0.90 % NegExts : 0
% 3.13/0.90 % Equation resolutions : 0
% 3.13/0.90 % Disequality decompositions : 0
% 3.13/0.90 % Total rewrite steps : 14256
% 3.13/0.90 % ...of those cached : 11401
% 3.13/0.90 % Propositional unsat checks : 0
% 3.13/0.90 % Propositional check models : 0
% 3.13/0.90 % Propositional check unsatisfiable : 0
% 3.13/0.90 % Propositional clauses : 0
% 3.13/0.90 % Propositional clauses after purity: 0
% 3.13/0.90 % Propositional unsat core size : 0
% 3.13/0.90 % Propositional preprocessing time : 0.000
% 3.13/0.90 % Propositional encoding time : 0.000
% 3.13/0.90 % Propositional solver time : 0.000
% 3.13/0.90 % Success case prop preproc time : 0.000
% 3.13/0.90 % Success case prop encoding time : 0.000
% 3.13/0.90 % Success case prop solver time : 0.000
% 3.13/0.90 % Current number of processed clauses : 468
% 3.13/0.90 % Positive orientable unit clauses : 191
% 3.13/0.90 % Positive unorientable unit clauses: 2
% 3.13/0.90 % Negative unit clauses : 4
% 3.13/0.90 % Non-unit-clauses : 271
% 3.13/0.90 % Current number of unprocessed clauses: 12419
% 3.13/0.90 % ...number of literals in the above : 19445
% 3.13/0.90 % Current number of archived formulas : 0
% 3.13/0.90 % Current number of archived clauses : 500
% 3.13/0.90 % Clause-clause subsumption calls (NU) : 70638
% 3.13/0.90 % Rec. Clause-clause subsumption calls : 61191
% 3.13/0.90 % Non-unit clause-clause subsumptions : 2427
% 3.13/0.90 % Unit Clause-clause subsumption calls : 1323
% 3.13/0.90 % Rewrite failures with RHS unbound : 0
% 3.13/0.90 % BW rewrite match attempts : 2498
% 3.13/0.90 % BW rewrite match successes : 416
% 3.13/0.90 % Condensation attempts : 0
% 3.13/0.90 % Condensation successes : 0
% 3.13/0.90 % Termbank termtop insertions : 254558
% 3.13/0.90 % Search garbage collected termcells : 46
% 3.13/0.90
% 3.13/0.90 % -------------------------------------------------
% 3.13/0.90 % User time : 0.452 s
% 3.13/0.90 % System time : 0.024 s
% 3.13/0.90 % Total time : 0.475 s
% 3.13/0.90 % Maximum resident set size: 3384 pages
% 3.13/0.90
% 3.13/0.90 % -------------------------------------------------
% 3.13/0.90 % User time : 2.329 s
% 3.13/0.90 % System time : 0.150 s
% 3.13/0.90 % Total time : 2.478 s
% 3.13/0.90 % Maximum resident set size: 4608 pages
% 3.13/0.90 % E exiting
%------------------------------------------------------------------------------