%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA133-1 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 12:02:58 PM UTC 2026
% Result : Unsatisfiable 11.11s 2.07s
% Output : CNFRefutation 11.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 8 RR)
% Number of literals : 37 ( 36 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(times_one,axiom,
times(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_one) ).
cnf(commutativity_of_times,axiom,
times(X1,X2) = times(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_times) ).
cnf(associtivity_of_plus,axiom,
'+'(X1,'+'(X2,X3)) = '+'('+'(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associtivity_of_plus) ).
cnf(minus,axiom,
'+'(X1,minus(X1)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minus) ).
cnf(plus_zero,axiom,
'+'(zero,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_zero) ).
cnf(derivative_of_times,axiom,
d(times(X1,X2)) = '+'(times(X1,d(X2)),times(X2,d(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',derivative_of_times) ).
cnf(derivative_of_x,axiom,
d(x) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',derivative_of_x) ).
cnf(commutativity_of_plus,axiom,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_plus) ).
cnf(derivative_of_cos,axiom,
d(cos(X1)) = minus(times(sin(X1),d(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',derivative_of_cos) ).
cnf(derivative_of_sin,axiom,
d(sin(X1)) = times(cos(X1),d(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',derivative_of_sin) ).
cnf(goal,negated_conjecture,
d(X1) != times(x,cos(x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(derivative_of_plus,axiom,
d('+'(X1,X2)) = '+'(d(X1),d(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',derivative_of_plus) ).
cnf(c_0_12,axiom,
times(one,X1) = X1,
times_one ).
cnf(c_0_13,axiom,
times(X1,X2) = times(X2,X1),
commutativity_of_times ).
cnf(c_0_14,axiom,
'+'(X1,'+'(X2,X3)) = '+'('+'(X1,X2),X3),
associtivity_of_plus ).
cnf(c_0_15,axiom,
'+'(X1,minus(X1)) = zero,
minus ).
cnf(c_0_16,axiom,
'+'(zero,X1) = X1,
plus_zero ).
cnf(c_0_17,axiom,
d(times(X1,X2)) = '+'(times(X1,d(X2)),times(X2,d(X1))),
derivative_of_times ).
cnf(c_0_18,axiom,
d(x) = one,
derivative_of_x ).
cnf(c_0_19,plain,
times(X1,one) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,axiom,
'+'(X1,X2) = '+'(X2,X1),
commutativity_of_plus ).
cnf(c_0_21,plain,
'+'(X1,'+'(minus(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_22,plain,
'+'(X1,times(x,d(X1))) = d(times(x,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
'+'(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_24,axiom,
d(cos(X1)) = minus(times(sin(X1),d(X1))),
derivative_of_cos ).
cnf(c_0_25,axiom,
d(sin(X1)) = times(cos(X1),d(X1)),
derivative_of_sin ).
cnf(c_0_26,plain,
'+'(X1,d(times(x,minus(X1)))) = times(x,d(minus(X1))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
minus(minus(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_23]) ).
cnf(c_0_28,plain,
minus(times(d(X1),sin(X1))) = d(cos(X1)),
inference(rw,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_29,plain,
times(d(X1),cos(X1)) = d(sin(X1)),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_30,negated_conjecture,
d(X1) != times(x,cos(x)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_31,plain,
'+'(d(times(x,X1)),minus(X1)) = times(x,d(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]) ).
cnf(c_0_32,plain,
minus(sin(x)) = d(cos(x)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_12]) ).
cnf(c_0_33,axiom,
d('+'(X1,X2)) = '+'(d(X1),d(X2)),
derivative_of_plus ).
cnf(c_0_34,plain,
d(sin(x)) = cos(x),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_12]) ).
cnf(c_0_35,negated_conjecture,
d(X1) != times(x,cos(x)),
c_0_30 ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA133-1 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 13:26:21 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 11.11/2.07 % Version: 3.5.1
% 11.11/2.07 % Preprocessing class: FSMSSMSSSSSNFFN.
% 11.11/2.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.11/2.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.11/2.07 % Starting new_bool_3 with 300s (1) cores
% 11.11/2.07 % Starting new_bool_1 with 300s (1) cores
% 11.11/2.07 % Starting sh5l with 300s (1) cores
% 11.11/2.07 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1191181 completed with status 0
% 11.11/2.07 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.11/2.07 % Preprocessing class: FSMSSMSSSSSNFFN.
% 11.11/2.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.11/2.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.11/2.07 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.11/2.07 % No SInE strategy applied
% 11.11/2.07 % Search class: FUUPM-FFSS21-MFFFFFNN
% 11.11/2.07 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.11/2.07 % Starting SubtermCWHack with 136s (1) cores
% 11.11/2.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.11/2.07 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 136s (1) cores
% 11.11/2.07 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 11.11/2.07 % Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 11.11/2.07 % G-E--_209_C18_F1_AE_CS_SP_S0Y with pid 1191192 completed with status 0
% 11.11/2.07 % Result found by G-E--_209_C18_F1_AE_CS_SP_S0Y
% 11.11/2.07 % Preprocessing class: FSMSSMSSSSSNFFN.
% 11.11/2.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.11/2.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.11/2.07 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.11/2.07 % No SInE strategy applied
% 11.11/2.07 % Search class: FUUPM-FFSS21-MFFFFFNN
% 11.11/2.07 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.11/2.07 % Starting SubtermCWHack with 136s (1) cores
% 11.11/2.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.11/2.07 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 136s (1) cores
% 11.11/2.07 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 11.11/2.07 % Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 11.11/2.07 % Preprocessing time : 0.001 s
% 11.11/2.07
% 11.11/2.07 % Proof found!
% 11.11/2.07 % SZS status Unsatisfiable
% 11.11/2.07 % SZS output start CNFRefutation
% See solution above
% 11.11/2.07 % Parsed axioms : 17
% 11.11/2.07 % Removed by relevancy pruning/SinE : 0
% 11.11/2.07 % Initial clauses : 17
% 11.11/2.07 % Removed in clause preprocessing : 0
% 11.11/2.07 % Initial clauses in saturation : 17
% 11.11/2.07 % Processed clauses : 10881
% 11.11/2.07 % ...of these trivial : 3422
% 11.11/2.07 % ...subsumed : 5207
% 11.11/2.07 % ...remaining for further processing : 2252
% 11.11/2.07 % Other redundant clauses eliminated : 0
% 11.11/2.07 % Clauses deleted for lack of memory : 0
% 11.11/2.07 % Backward-subsumed : 0
% 11.11/2.07 % Backward-rewritten : 71
% 11.11/2.07 % Generated clauses : 168385
% 11.11/2.07 % ...of the previous two non-redundant : 105288
% 11.11/2.07 % ...aggressively subsumed : 0
% 11.11/2.07 % Contextual simplify-reflections : 0
% 11.11/2.07 % Paramodulations : 168385
% 11.11/2.07 % Factorizations : 0
% 11.11/2.07 % NegExts : 0
% 11.11/2.07 % Equation resolutions : 0
% 11.11/2.07 % Disequality decompositions : 0
% 11.11/2.07 % Total rewrite steps : 299087
% 11.11/2.07 % ...of those cached : 244822
% 11.11/2.07 % Propositional unsat checks : 0
% 11.11/2.07 % Propositional check models : 0
% 11.11/2.07 % Propositional check unsatisfiable : 0
% 11.11/2.07 % Propositional clauses : 0
% 11.11/2.07 % Propositional clauses after purity: 0
% 11.11/2.07 % Propositional unsat core size : 0
% 11.11/2.07 % Propositional preprocessing time : 0.000
% 11.11/2.07 % Propositional encoding time : 0.000
% 11.11/2.07 % Propositional solver time : 0.000
% 11.11/2.07 % Success case prop preproc time : 0.000
% 11.11/2.07 % Success case prop encoding time : 0.000
% 11.11/2.07 % Success case prop solver time : 0.000
% 11.11/2.07 % Current number of processed clauses : 2181
% 11.11/2.07 % Positive orientable unit clauses : 2140
% 11.11/2.07 % Positive unorientable unit clauses: 34
% 11.11/2.07 % Negative unit clauses : 7
% 11.11/2.07 % Non-unit-clauses : 0
% 11.11/2.07 % Current number of unprocessed clauses: 93411
% 11.11/2.07 % ...number of literals in the above : 93411
% 11.11/2.07 % Current number of archived formulas : 0
% 11.11/2.07 % Current number of archived clauses : 71
% 11.11/2.07 % Clause-clause subsumption calls (NU) : 0
% 11.11/2.07 % Rec. Clause-clause subsumption calls : 0
% 11.11/2.07 % Non-unit clause-clause subsumptions : 0
% 11.11/2.07 % Unit Clause-clause subsumption calls : 176
% 11.11/2.07 % Rewrite failures with RHS unbound : 0
% 11.11/2.07 % BW rewrite match attempts : 139462
% 11.11/2.07 % BW rewrite match successes : 289
% 11.11/2.07 % Condensation attempts : 0
% 11.11/2.07 % Condensation successes : 0
% 11.11/2.07 % Termbank termtop insertions : 2680671
% 11.11/2.07 % Search garbage collected termcells : 2
% 11.11/2.07
% 11.11/2.07 % -------------------------------------------------
% 11.11/2.07 % User time : 1.456 s
% 11.11/2.07 % System time : 0.105 s
% 11.11/2.07 % Total time : 1.561 s
% 11.11/2.07 % Maximum resident set size: 3636 pages
% 11.11/2.07
% 11.11/2.07 % -------------------------------------------------
% 11.11/2.07 % User time : 7.440 s
% 11.11/2.07 % System time : 0.451 s
% 11.11/2.07 % Total time : 7.891 s
% 11.11/2.07 % Maximum resident set size: 4864 pages
% 11.11/2.07 % E exiting
%------------------------------------------------------------------------------