TSTP Solution File: RNG039-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG039-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:14:49 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 43 unt; 0 nHn; 34 RR)
% Number of literals : 71 ( 28 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 56 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause44,axiom,
product(a,multiply(b,X1),multiply(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause44) ).
cnf(clause35,axiom,
multiply(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause35) ).
cnf(multiplication_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',multiplication_is_well_defined) ).
cnf(b_times_a,negated_conjecture,
product(b,a,d),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',b_times_a) ).
cnf(clause57,axiom,
product(multiply(X1,b),a,multiply(X1,d)),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause57) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',closure_of_multiplication) ).
cnf(clause37,axiom,
multiply(b,a) = d,
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause37) ).
cnf(a_times_b,negated_conjecture,
product(a,b,c),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',a_times_b) ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',addition_is_well_defined) ).
cnf(clause32,axiom,
sum(X1,X1,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause32) ).
cnf(clause68,axiom,
product(add(b,a),b,add(b,c)),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause68) ).
cnf(clause34,axiom,
add(X1,X1) = additive_identity,
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause34) ).
cnf(clause70,axiom,
product(add(a,b),a,add(a,d)),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',clause70) ).
cnf(prove_c_equals_d,negated_conjecture,
c != d,
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',prove_c_equals_d) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p',closure_of_addition) ).
cnf(c_0_15,axiom,
product(a,multiply(b,X1),multiply(X2,X1)),
clause44 ).
cnf(c_0_16,axiom,
multiply(X1,X1) = X1,
clause35 ).
cnf(c_0_17,plain,
product(a,b,multiply(X1,b)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
multiplication_is_well_defined ).
cnf(c_0_19,plain,
product(a,b,b),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_20,plain,
( X1 = b
| ~ product(a,b,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
product(b,a,d),
b_times_a ).
cnf(c_0_22,axiom,
product(multiply(X1,b),a,multiply(X1,d)),
clause57 ).
cnf(c_0_23,plain,
multiply(X1,b) = b,
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( X1 = d
| ~ product(b,a,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_25,plain,
product(b,a,multiply(X1,d)),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_27,negated_conjecture,
multiply(X1,d) = d,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
multiply(b,a) = d,
clause37 ).
cnf(c_0_29,negated_conjecture,
product(X1,d,d),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
product(a,d,multiply(X1,a)),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
product(a,b,c),
a_times_b ).
cnf(c_0_32,negated_conjecture,
( X1 = d
| ~ product(X2,d,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_33,plain,
product(a,d,a),
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_34,plain,
product(X1,b,b),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_35,negated_conjecture,
( X1 = c
| ~ product(a,b,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
d = a,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_38,axiom,
sum(X1,X1,additive_identity),
clause32 ).
cnf(c_0_39,plain,
( X1 = b
| ~ product(X2,b,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_40,axiom,
product(add(b,a),b,add(b,c)),
clause68 ).
cnf(c_0_41,negated_conjecture,
c = b,
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_42,axiom,
add(X1,X1) = additive_identity,
clause34 ).
cnf(c_0_43,negated_conjecture,
( X1 = a
| ~ product(X2,a,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_36]),c_0_36]) ).
cnf(c_0_44,axiom,
product(add(a,b),a,add(a,d)),
clause70 ).
cnf(c_0_45,negated_conjecture,
c != d,
prove_c_equals_d ).
cnf(c_0_46,plain,
( X1 = additive_identity
| ~ sum(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,plain,
additive_identity = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_48,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_49,negated_conjecture,
add(a,a) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_36]) ).
cnf(c_0_50,negated_conjecture,
d != b,
inference(rw,[status(thm)],[c_0_45,c_0_41]) ).
cnf(c_0_51,plain,
( X1 = b
| ~ sum(X2,X2,X1) ),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
sum(a,a,a),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
b != a,
inference(rw,[status(thm)],[c_0_50,c_0_36]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : RNG039-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 19:44:28 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.oU1U8aWOac/E---3.1_7345.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7470 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUSM-FFMM21-SFFFFFNN
% 0.20/0.52 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7475 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUSM-FFMM21-SFFFFFNN
% 0.20/0.52 # partial match(1): FHUSM-FFMF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 60
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 60
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 60
% 0.20/0.52 # Processed clauses : 222
% 0.20/0.52 # ...of these trivial : 12
% 0.20/0.52 # ...subsumed : 15
% 0.20/0.52 # ...remaining for further processing : 195
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 4
% 0.20/0.52 # Backward-rewritten : 84
% 0.20/0.52 # Generated clauses : 633
% 0.20/0.52 # ...of the previous two non-redundant : 505
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 633
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 387
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 47
% 0.20/0.52 # Positive orientable unit clauses : 28
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 18
% 0.20/0.52 # Current number of unprocessed clauses: 381
% 0.20/0.52 # ...number of literals in the above : 1215
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 148
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 300
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 209
% 0.20/0.52 # Non-unit clause-clause subsumptions : 19
% 0.20/0.52 # Unit Clause-clause subsumption calls : 36
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 156
% 0.20/0.52 # BW rewrite match successes : 29
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 7941
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.015 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.019 s
% 0.20/0.52 # Maximum resident set size: 1724 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.076 s
% 0.20/0.52 # System time : 0.012 s
% 0.20/0.52 # Total time : 0.088 s
% 0.20/0.52 # Maximum resident set size: 1712 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------