TSTP Solution File: ANA133-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ANA133-1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:38:21 EDT 2024
% Result : Unsatisfiable 13.45s 2.17s
% Output : CNFRefutation 13.45s
% 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.02/0.11 % Problem : ANA133-1 : TPTP v8.2.0. Released v8.1.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n004.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 07:41:22 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 13.45/2.17 # Version: 3.1.0
% 13.45/2.17 # Preprocessing class: FSMSSMSSSSSNFFN.
% 13.45/2.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.45/2.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.45/2.17 # Starting new_bool_3 with 300s (1) cores
% 13.45/2.17 # Starting new_bool_1 with 300s (1) cores
% 13.45/2.17 # Starting sh5l with 300s (1) cores
% 13.45/2.17 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3156 completed with status 0
% 13.45/2.17 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.45/2.17 # Preprocessing class: FSMSSMSSSSSNFFN.
% 13.45/2.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.45/2.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.45/2.17 # No SInE strategy applied
% 13.45/2.17 # Search class: FUUPM-FFSS21-MFFFFFNN
% 13.45/2.17 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 13.45/2.17 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 13.45/2.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.45/2.17 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 13.45/2.17 # Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 13.45/2.17 # Starting new_bool_3 with 136s (1) cores
% 13.45/2.17 # G-E--_209_C18_F1_AE_CS_SP_S0Y with pid 3165 completed with status 0
% 13.45/2.17 # Result found by G-E--_209_C18_F1_AE_CS_SP_S0Y
% 13.45/2.17 # Preprocessing class: FSMSSMSSSSSNFFN.
% 13.45/2.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.45/2.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.45/2.17 # No SInE strategy applied
% 13.45/2.17 # Search class: FUUPM-FFSS21-MFFFFFNN
% 13.45/2.17 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 13.45/2.17 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 13.45/2.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.45/2.17 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 13.45/2.17 # Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 13.45/2.17 # Preprocessing time : 0.001 s
% 13.45/2.17
% 13.45/2.17 # Proof found!
% 13.45/2.17 # SZS status Unsatisfiable
% 13.45/2.17 # SZS output start CNFRefutation
% See solution above
% 13.45/2.17 # Parsed axioms : 17
% 13.45/2.17 # Removed by relevancy pruning/SinE : 0
% 13.45/2.17 # Initial clauses : 17
% 13.45/2.17 # Removed in clause preprocessing : 0
% 13.45/2.17 # Initial clauses in saturation : 17
% 13.45/2.17 # Processed clauses : 10881
% 13.45/2.17 # ...of these trivial : 3422
% 13.45/2.17 # ...subsumed : 5207
% 13.45/2.17 # ...remaining for further processing : 2252
% 13.45/2.17 # Other redundant clauses eliminated : 0
% 13.45/2.17 # Clauses deleted for lack of memory : 0
% 13.45/2.17 # Backward-subsumed : 0
% 13.45/2.17 # Backward-rewritten : 71
% 13.45/2.17 # Generated clauses : 168385
% 13.45/2.17 # ...of the previous two non-redundant : 105288
% 13.45/2.17 # ...aggressively subsumed : 0
% 13.45/2.17 # Contextual simplify-reflections : 0
% 13.45/2.17 # Paramodulations : 168385
% 13.45/2.17 # Factorizations : 0
% 13.45/2.17 # NegExts : 0
% 13.45/2.17 # Equation resolutions : 0
% 13.45/2.17 # Disequality decompositions : 0
% 13.45/2.17 # Total rewrite steps : 299087
% 13.45/2.17 # ...of those cached : 244822
% 13.45/2.17 # Propositional unsat checks : 0
% 13.45/2.17 # Propositional check models : 0
% 13.45/2.17 # Propositional check unsatisfiable : 0
% 13.45/2.17 # Propositional clauses : 0
% 13.45/2.17 # Propositional clauses after purity: 0
% 13.45/2.17 # Propositional unsat core size : 0
% 13.45/2.17 # Propositional preprocessing time : 0.000
% 13.45/2.17 # Propositional encoding time : 0.000
% 13.45/2.17 # Propositional solver time : 0.000
% 13.45/2.17 # Success case prop preproc time : 0.000
% 13.45/2.17 # Success case prop encoding time : 0.000
% 13.45/2.17 # Success case prop solver time : 0.000
% 13.45/2.17 # Current number of processed clauses : 2181
% 13.45/2.17 # Positive orientable unit clauses : 2140
% 13.45/2.17 # Positive unorientable unit clauses: 34
% 13.45/2.17 # Negative unit clauses : 7
% 13.45/2.17 # Non-unit-clauses : 0
% 13.45/2.17 # Current number of unprocessed clauses: 93411
% 13.45/2.17 # ...number of literals in the above : 93411
% 13.45/2.17 # Current number of archived formulas : 0
% 13.45/2.17 # Current number of archived clauses : 71
% 13.45/2.17 # Clause-clause subsumption calls (NU) : 0
% 13.45/2.17 # Rec. Clause-clause subsumption calls : 0
% 13.45/2.17 # Non-unit clause-clause subsumptions : 0
% 13.45/2.17 # Unit Clause-clause subsumption calls : 176
% 13.45/2.17 # Rewrite failures with RHS unbound : 0
% 13.45/2.17 # BW rewrite match attempts : 139462
% 13.45/2.17 # BW rewrite match successes : 289
% 13.45/2.17 # Condensation attempts : 0
% 13.45/2.17 # Condensation successes : 0
% 13.45/2.17 # Termbank termtop insertions : 2680654
% 13.45/2.17 # Search garbage collected termcells : 2
% 13.45/2.17
% 13.45/2.17 # -------------------------------------------------
% 13.45/2.17 # User time : 1.564 s
% 13.45/2.17 # System time : 0.078 s
% 13.45/2.17 # Total time : 1.642 s
% 13.45/2.17 # Maximum resident set size: 1580 pages
% 13.45/2.17
% 13.45/2.17 # -------------------------------------------------
% 13.45/2.17 # User time : 7.901 s
% 13.45/2.17 # System time : 0.327 s
% 13.45/2.17 # Total time : 8.228 s
% 13.45/2.17 # Maximum resident set size: 1692 pages
% 13.45/2.17 % E---3.1 exiting
% 13.45/2.17 % E exiting
%------------------------------------------------------------------------------