TSTP Solution File: NUN133-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUN133-1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Tue May 21 02:15:43 EDT 2024
% Result : Timeout 300.34s 38.23s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 9 RR)
% Number of literals : 38 ( 37 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
times(sum(s(a)),sum(s(a))) != cubes(s(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(sum_s,axiom,
sum(s(X1)) = '+'(s(X1),sum(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_s) ).
cnf(plus_comm,axiom,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_comm) ).
cnf(cubes_s,axiom,
cubes(s(X1)) = '+'(times(s(X1),times(s(X1),s(X1))),cubes(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cubes_s) ).
cnf(times_s,axiom,
times(s(X1),X2) = '+'(X2,times(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_s) ).
cnf(plus_sum,axiom,
'+'(sum(X1),sum(X1)) = times(X1,s(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_sum) ).
cnf(induction_hypothesis,axiom,
times(sum(a),sum(a)) = cubes(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',induction_hypothesis) ).
cnf(plus_assoc,axiom,
'+'(X1,'+'(X2,X3)) = '+'('+'(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_assoc) ).
cnf(distr,axiom,
times(X1,'+'(X2,X3)) = '+'(times(X1,X2),times(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distr) ).
cnf(distr_001,axiom,
times('+'(X1,X2),X3) = '+'(times(X1,X3),times(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distr_001) ).
cnf(times_one,axiom,
times(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_one) ).
cnf(times_comm,axiom,
times(X1,X2) = times(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_comm) ).
cnf(times_assoc,axiom,
times(X1,times(X2,X3)) = times(times(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_assoc) ).
cnf(c_0_13,negated_conjecture,
times(sum(s(a)),sum(s(a))) != cubes(s(a)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_14,axiom,
sum(s(X1)) = '+'(s(X1),sum(X1)),
sum_s ).
cnf(c_0_15,axiom,
'+'(X1,X2) = '+'(X2,X1),
plus_comm ).
cnf(c_0_16,negated_conjecture,
times(sum(s(a)),sum(s(a))) != cubes(s(a)),
c_0_13 ).
cnf(c_0_17,plain,
sum(s(X1)) = '+'(sum(X1),s(X1)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
cubes(s(X1)) = '+'(times(s(X1),times(s(X1),s(X1))),cubes(X1)),
cubes_s ).
cnf(c_0_19,axiom,
times(s(X1),X2) = '+'(X2,times(X1,X2)),
times_s ).
cnf(c_0_20,axiom,
'+'(sum(X1),sum(X1)) = times(X1,s(X1)),
plus_sum ).
cnf(c_0_21,negated_conjecture,
cubes(s(a)) != times('+'(sum(a),s(a)),'+'(sum(a),s(a))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_22,plain,
cubes(s(X1)) = '+'(cubes(X1),'+'('+'('+'(sum(X1),sum(X1)),s(X1)),times(X1,'+'('+'(sum(X1),sum(X1)),s(X1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_15]),c_0_19]),c_0_15]) ).
cnf(c_0_23,axiom,
times(sum(a),sum(a)) = cubes(a),
induction_hypothesis ).
cnf(c_0_24,negated_conjecture,
times('+'(sum(a),s(a)),'+'(sum(a),s(a))) != '+'(times(sum(a),sum(a)),'+'('+'('+'(sum(a),sum(a)),s(a)),times(a,'+'('+'(sum(a),sum(a)),s(a))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,axiom,
'+'(X1,'+'(X2,X3)) = '+'('+'(X1,X2),X3),
plus_assoc ).
cnf(c_0_26,axiom,
times(X1,'+'(X2,X3)) = '+'(times(X1,X2),times(X1,X3)),
distr ).
cnf(c_0_27,axiom,
times('+'(X1,X2),X3) = '+'(times(X1,X3),times(X2,X3)),
distr_001 ).
cnf(c_0_28,axiom,
times(X1,one) = X1,
times_one ).
cnf(c_0_29,axiom,
times(X1,X2) = times(X2,X1),
times_comm ).
cnf(c_0_30,axiom,
times(X1,times(X2,X3)) = times(times(X1,X2),X3),
times_assoc ).
cnf(c_0_31,negated_conjecture,
'+'(sum(a),'+'(times(a,sum(a)),'+'(times(sum(a),sum(a)),'+'(sum(a),'+'(sum(a),'+'(s(a),times(sum(a),s(a)))))))) != '+'(times(sum(a),sum(a)),'+'(sum(a),'+'(sum(a),'+'(times(a,sum(a)),'+'(sum(a),'+'(sum(a),'+'(times(a,sum(a)),s(a)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]),c_0_26]),c_0_27]),c_0_19]),c_0_15]),c_0_25]),c_0_27]),c_0_19]),c_0_20]),c_0_15]),c_0_25]),c_0_15]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_26]),c_0_26]),c_0_20]),c_0_15]),c_0_25]),c_0_15]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_32,plain,
s(X1) = '+'(one,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_28]) ).
cnf(c_0_33,plain,
'+'(X1,X2) = '+'(X2,X1),
c_0_15 ).
cnf(c_0_34,plain,
times(X1,X2) = times(X2,X1),
c_0_29 ).
cnf(c_0_35,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
c_0_25 ).
cnf(c_0_36,plain,
times(times(X1,X2),X3) = times(X1,times(X2,X3)),
c_0_30 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32]),c_0_26]),c_0_28]),c_0_29]),c_0_25]),c_0_15]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_32]),c_0_15]),c_0_25]),c_0_15]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_33,c_0_34,c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUN133-1 : TPTP v8.2.0. Released v8.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 15:12:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 300.34/38.23 # Version: 3.1.0
% 300.34/38.23 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.34/38.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.34/38.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.34/38.23 # Starting new_bool_3 with 300s (1) cores
% 300.34/38.23 # Starting new_bool_1 with 300s (1) cores
% 300.34/38.23 # Starting sh5l with 300s (1) cores
% 300.34/38.23 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19654 completed with status 7
% 300.34/38.23 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 300.34/38.23 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.34/38.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.34/38.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.34/38.23 # No SInE strategy applied
% 300.34/38.23 # Search class: FUUPM-FFSS21-MFFFFFNN
% 300.34/38.23 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 300.34/38.23 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 300.34/38.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 300.34/38.23 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 300.34/38.23 # Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 300.34/38.23 # Starting new_bool_3 with 136s (1) cores
% 300.34/38.23 # new_bool_3 with pid 19665 completed with status 7
% 300.34/38.23 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 130s (1) cores
% 300.34/38.23 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 19667 completed with status 0
% 300.34/38.23 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 300.34/38.23 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.34/38.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.34/38.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.34/38.23 # No SInE strategy applied
% 300.34/38.23 # Search class: FUUPM-FFSS21-MFFFFFNN
% 300.34/38.23 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 300.34/38.23 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 300.34/38.23 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 300.34/38.23 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 300.34/38.23 # Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 300.34/38.23 # Starting new_bool_3 with 136s (1) cores
% 300.34/38.23 # new_bool_3 with pid 19665 completed with status 7
% 300.34/38.23 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 130s (1) cores
% 300.34/38.23 # Preprocessing time : 0.001 s
% 300.34/38.23 # Presaturation interreduction done
% 300.34/38.23
% 300.34/38.23 # Proof found!
% 300.34/38.23 # SZS status Unsatisfiable
% 300.34/38.23 # SZS output start CNFRefutation
% See solution above
% 300.34/38.23 # Parsed axioms : 18
% 300.34/38.23 # Removed by relevancy pruning/SinE : 0
% 300.34/38.23 # Initial clauses : 18
% 300.34/38.23 # Removed in clause preprocessing : 0
% 300.34/38.23 # Initial clauses in saturation : 18
% 300.34/38.23 # Processed clauses : 44
% 300.34/38.23 # ...of these trivial : 2
% 300.34/38.23 # ...subsumed : 0
% 300.34/38.23 # ...remaining for further processing : 41
% 300.34/38.23 # Other redundant clauses eliminated : 0
% 300.34/38.23 # Clauses deleted for lack of memory : 0
% 300.34/38.23 # Backward-subsumed : 0
% 300.34/38.23 # Backward-rewritten : 8
% 300.34/38.23 # Generated clauses : 64
% 300.34/38.23 # ...of the previous two non-redundant : 46
% 300.34/38.23 # ...aggressively subsumed : 0
% 300.34/38.23 # Contextual simplify-reflections : 0
% 300.34/38.23 # Paramodulations : 64
% 300.34/38.23 # Factorizations : 0
% 300.34/38.23 # NegExts : 0
% 300.34/38.23 # Equation resolutions : 0
% 300.34/38.23 # Disequality decompositions : 0
% 300.34/38.23 # Total rewrite steps : 161
% 300.34/38.23 # ...of those cached : 45
% 300.34/38.23 # Propositional unsat checks : 0
% 300.34/38.23 # Propositional check models : 0
% 300.34/38.23 # Propositional check unsatisfiable : 0
% 300.34/38.23 # Propositional clauses : 0
% 300.34/38.23 # Propositional clauses after purity: 0
% 300.34/38.23 # Propositional unsat core size : 0
% 300.34/38.23 # Propositional preprocessing time : 0.000
% 300.34/38.23 # Propositional encoding time : 0.000
% 300.34/38.23 # Propositional solver time : 0.000
% 300.34/38.23 # Success case prop preproc time : 0.000
% 300.34/38.23 # Success case prop encoding time : 0.000
% 300.34/38.23 # Success case prop solver time : 0.000
% 300.34/38.23 # Current number of processed clauses : 15
% 300.34/38.23 # Positive orientable unit clauses : 13
% 300.34/38.23 # Positive unorientable unit clauses: 2
% 300.34/38.23 # Negative unit clauses : 0
% 300.34/38.23 # Non-unit-clauses : 0
% 300.34/38.23 # Current number of unprocessed clauses: 38
% 300.34/38.23 # ...number of literals in the above : 38
% 300.34/38.23 # Current number of archived formulas : 0
% 300.34/38.23 # Current number of archived clauses : 26
% 300.34/38.23 # Clause-clause subsumption calls (NU) : 0
% 300.34/38.23 # Rec. Clause-clause subsumption calls : 0
% 300.34/38.23 # Non-unit clause-clause subsumptions : 0
% 300.34/38.23 # Unit Clause-clause subsumption calls : 0
% 300.34/38.23 # Rewrite failures with RHS unbound : 0
% 300.34/38.23 # BW rewrite match attempts : 26
% 300.34/38.23 # BW rewrite match successes : 26
% 300.34/38.23 # Condensation attempts : 0
% 300.34/38.23 # Condensation successes : 0
% 300.34/38.23 # Termbank termtop insertions : 1158
% 300.34/38.23 # Search garbage collected termcells : 2
% 300.34/38.23
% 300.34/38.23 # -------------------------------------------------
% 300.34/38.23 # User time : 37.579 s
% 300.34/38.23 # System time : 0.005 s
% 300.34/38.23 # Total time : 37.585 s
% 300.34/38.23 # Maximum resident set size: 1628 pages
% 300.34/38.23
% 300.34/38.23 # -------------------------------------------------
% 300.34/38.23 # User time : 37.579 s
% 300.34/38.23 # System time : 0.010 s
% 300.34/38.23 # Total time : 37.589 s
% 300.34/38.23 # Maximum resident set size: 1696 pages
% 300.34/38.23 % E---3.1 exiting
% 300.34/38.23 Cputime limit exceeded (core dumped)
% 300.34/38.23 % E exiting
%------------------------------------------------------------------------------