TSTP Solution File: RNG001-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG001-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:15:16 EDT 2023
% Result : Unsatisfiable 38.61s 5.40s
% Output : CNFRefutation 38.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 68 ( 30 unt; 0 nHn; 37 RR)
% Number of literals : 143 ( 0 equ; 77 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 195 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',distributivity1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',closure_of_multiplication) ).
cnf(addition_is_well_defined,axiom,
( equalish(X3,X4)
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',addition_is_well_defined) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',additive_identity1) ).
cnf(sum_substitution3,axiom,
( sum(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ sum(X3,X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',sum_substitution3) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',additive_identity2) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',closure_of_addition) ).
cnf(associativity_of_addition1,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',associativity_of_addition1) ).
cnf(additive_inverse2,axiom,
sum(X1,additive_inverse(X1),additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',additive_inverse2) ).
cnf(associativity_of_addition2,axiom,
( sum(X3,X4,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',associativity_of_addition2) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',commutativity_of_addition) ).
cnf(distributivity4,axiom,
( product(X6,X2,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',distributivity4) ).
cnf(theorem,negated_conjecture,
~ product(a,additive_identity,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p',theorem) ).
cnf(c_0_13,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
distributivity1 ).
cnf(c_0_14,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_15,axiom,
( equalish(X3,X4)
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_16,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_17,plain,
( sum(X1,X2,multiply(X3,X4))
| ~ product(X3,X5,X2)
| ~ product(X3,X6,X1)
| ~ sum(X6,X5,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
( sum(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ sum(X3,X4,X1) ),
sum_substitution3 ).
cnf(c_0_19,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_20,plain,
( equalish(X1,X2)
| ~ sum(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_22,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
associativity_of_addition1 ).
cnf(c_0_23,axiom,
sum(X1,additive_inverse(X1),additive_identity),
additive_inverse2 ).
cnf(c_0_24,plain,
( sum(X1,multiply(X2,X3),multiply(X2,X4))
| ~ product(X2,X5,X1)
| ~ sum(X5,X3,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_25,axiom,
( sum(X3,X4,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X5,X6) ),
associativity_of_addition2 ).
cnf(c_0_26,plain,
( sum(X1,additive_identity,X2)
| ~ equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
equalish(add(additive_identity,X1),X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( sum(X1,X2,additive_identity)
| ~ sum(X3,additive_inverse(X4),X2)
| ~ sum(X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( sum(multiply(X1,X2),multiply(X1,X3),multiply(X1,X4))
| ~ sum(X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_30,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ sum(X4,additive_identity,X3)
| ~ sum(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_31,plain,
sum(add(additive_identity,X1),additive_identity,X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_33,plain,
( sum(X1,additive_identity,X2)
| ~ sum(X3,X4,X2)
| ~ sum(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_34,plain,
( sum(X1,additive_identity,additive_identity)
| ~ sum(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_35,plain,
sum(multiply(X1,additive_identity),multiply(X1,X2),multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_36,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ sum(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_37,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,add(additive_identity,X3))
| ~ sum(X4,additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_38,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_39,plain,
( sum(X1,additive_identity,X2)
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_40,plain,
sum(multiply(X1,additive_identity),additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
sum(additive_identity,additive_inverse(additive_inverse(X1)),X1),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_42,axiom,
( product(X6,X2,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ sum(X3,X5,X7) ),
distributivity4 ).
cnf(c_0_43,plain,
( sum(X1,X2,X1)
| ~ sum(additive_identity,additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
sum(additive_identity,additive_identity,multiply(X1,additive_identity)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
equalish(X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_46,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_47,plain,
( product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X5,multiply(X6,X2),X3)
| ~ sum(X4,X6,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_14]) ).
cnf(c_0_48,plain,
sum(X1,multiply(X2,additive_identity),X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_identity,X2)
| ~ sum(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_50,plain,
sum(X1,additive_identity,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_26,c_0_45]) ).
cnf(c_0_51,plain,
( sum(X1,X2,X3)
| ~ sum(additive_inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_23]) ).
cnf(c_0_52,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_identity,X1)
| ~ sum(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_53,plain,
( product(X1,additive_identity,X2)
| ~ product(X3,additive_identity,X2)
| ~ sum(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( sum(X1,additive_inverse(additive_inverse(X2)),X3)
| ~ sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
sum(X1,add(additive_inverse(X1),X2),X2),
inference(spm,[status(thm)],[c_0_51,c_0_21]) ).
cnf(c_0_56,plain,
( sum(multiply(X1,additive_identity),X2,X3)
| ~ sum(additive_identity,X2,X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_44]) ).
cnf(c_0_57,plain,
( product(X1,additive_identity,multiply(X2,additive_identity))
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_14]) ).
cnf(c_0_58,plain,
sum(X1,additive_inverse(additive_inverse(add(additive_inverse(X1),X2))),X2),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( sum(X1,additive_inverse(X1),X2)
| ~ equalish(additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_60,plain,
sum(multiply(X1,additive_identity),multiply(X2,additive_identity),additive_identity),
inference(spm,[status(thm)],[c_0_56,c_0_48]) ).
cnf(c_0_61,plain,
product(X1,additive_identity,multiply(X2,additive_identity)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
sum(X1,additive_inverse(X1),additive_inverse(additive_inverse(additive_identity))),
inference(spm,[status(thm)],[c_0_59,c_0_45]) ).
cnf(c_0_63,plain,
( product(X1,additive_identity,additive_identity)
| ~ sum(X2,X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_60]),c_0_61])]) ).
cnf(c_0_64,plain,
sum(additive_inverse(additive_inverse(additive_identity)),additive_inverse(additive_inverse(X1)),X1),
inference(spm,[status(thm)],[c_0_36,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
~ product(a,additive_identity,additive_identity),
theorem ).
cnf(c_0_66,plain,
product(X1,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : RNG001-2 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 19:36:35 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.IhPLm4f6ut/E---3.1_1870.p
% 38.61/5.40 # Version: 3.1pre001
% 38.61/5.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 38.61/5.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.61/5.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 38.61/5.40 # Starting new_bool_3 with 300s (1) cores
% 38.61/5.40 # Starting new_bool_1 with 300s (1) cores
% 38.61/5.40 # Starting sh5l with 300s (1) cores
% 38.61/5.40 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2063 completed with status 0
% 38.61/5.40 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 38.61/5.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 38.61/5.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.61/5.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 38.61/5.40 # No SInE strategy applied
% 38.61/5.40 # Search class: FHUNM-FFMF21-SFFFFFNN
% 38.61/5.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 38.61/5.40 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 811s (1) cores
% 38.61/5.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 38.61/5.40 # Starting G-E--_107_C09_12_F1_PI_AE_Q4_CS_SP_PS_S064A with 136s (1) cores
% 38.61/5.40 # Starting new_bool_3 with 136s (1) cores
% 38.61/5.40 # Starting new_bool_1 with 136s (1) cores
% 38.61/5.40 # G-E--_107_C09_12_F1_PI_AE_Q4_CS_SP_PS_S064A with pid 2072 completed with status 0
% 38.61/5.40 # Result found by G-E--_107_C09_12_F1_PI_AE_Q4_CS_SP_PS_S064A
% 38.61/5.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 38.61/5.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.61/5.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 38.61/5.40 # No SInE strategy applied
% 38.61/5.40 # Search class: FHUNM-FFMF21-SFFFFFNN
% 38.61/5.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 38.61/5.40 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 811s (1) cores
% 38.61/5.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 38.61/5.40 # Starting G-E--_107_C09_12_F1_PI_AE_Q4_CS_SP_PS_S064A with 136s (1) cores
% 38.61/5.40 # Preprocessing time : 0.001 s
% 38.61/5.40 # Presaturation interreduction done
% 38.61/5.40
% 38.61/5.40 # Proof found!
% 38.61/5.40 # SZS status Unsatisfiable
% 38.61/5.40 # SZS output start CNFRefutation
% See solution above
% 38.61/5.40 # Parsed axioms : 18
% 38.61/5.40 # Removed by relevancy pruning/SinE : 0
% 38.61/5.40 # Initial clauses : 18
% 38.61/5.40 # Removed in clause preprocessing : 0
% 38.61/5.40 # Initial clauses in saturation : 18
% 38.61/5.40 # Processed clauses : 15398
% 38.61/5.40 # ...of these trivial : 5690
% 38.61/5.40 # ...subsumed : 5385
% 38.61/5.40 # ...remaining for further processing : 4323
% 38.61/5.40 # Other redundant clauses eliminated : 0
% 38.61/5.40 # Clauses deleted for lack of memory : 0
% 38.61/5.40 # Backward-subsumed : 418
% 38.61/5.40 # Backward-rewritten : 371
% 38.61/5.40 # Generated clauses : 884666
% 38.61/5.40 # ...of the previous two non-redundant : 784481
% 38.61/5.40 # ...aggressively subsumed : 0
% 38.61/5.40 # Contextual simplify-reflections : 0
% 38.61/5.40 # Paramodulations : 884666
% 38.61/5.40 # Factorizations : 0
% 38.61/5.40 # NegExts : 0
% 38.61/5.40 # Equation resolutions : 0
% 38.61/5.40 # Total rewrite steps : 106047
% 38.61/5.40 # Propositional unsat checks : 0
% 38.61/5.40 # Propositional check models : 0
% 38.61/5.40 # Propositional check unsatisfiable : 0
% 38.61/5.40 # Propositional clauses : 0
% 38.61/5.40 # Propositional clauses after purity: 0
% 38.61/5.40 # Propositional unsat core size : 0
% 38.61/5.40 # Propositional preprocessing time : 0.000
% 38.61/5.40 # Propositional encoding time : 0.000
% 38.61/5.40 # Propositional solver time : 0.000
% 38.61/5.40 # Success case prop preproc time : 0.000
% 38.61/5.40 # Success case prop encoding time : 0.000
% 38.61/5.40 # Success case prop solver time : 0.000
% 38.61/5.40 # Current number of processed clauses : 3516
% 38.61/5.40 # Positive orientable unit clauses : 1219
% 38.61/5.40 # Positive unorientable unit clauses: 0
% 38.61/5.40 # Negative unit clauses : 0
% 38.61/5.40 # Non-unit-clauses : 2297
% 38.61/5.40 # Current number of unprocessed clauses: 765051
% 38.61/5.40 # ...number of literals in the above : 831882
% 38.61/5.40 # Current number of archived formulas : 0
% 38.61/5.40 # Current number of archived clauses : 807
% 38.61/5.40 # Clause-clause subsumption calls (NU) : 1889143
% 38.61/5.40 # Rec. Clause-clause subsumption calls : 1767815
% 38.61/5.40 # Non-unit clause-clause subsumptions : 5803
% 38.61/5.40 # Unit Clause-clause subsumption calls : 24147
% 38.61/5.40 # Rewrite failures with RHS unbound : 0
% 38.61/5.40 # BW rewrite match attempts : 90799
% 38.61/5.40 # BW rewrite match successes : 370
% 38.61/5.40 # Condensation attempts : 0
% 38.61/5.40 # Condensation successes : 0
% 38.61/5.40 # Termbank termtop insertions : 11865044
% 38.61/5.40
% 38.61/5.40 # -------------------------------------------------
% 38.61/5.40 # User time : 4.535 s
% 38.61/5.40 # System time : 0.248 s
% 38.61/5.40 # Total time : 4.783 s
% 38.61/5.40 # Maximum resident set size: 1648 pages
% 38.61/5.40
% 38.61/5.40 # -------------------------------------------------
% 38.61/5.40 # User time : 23.228 s
% 38.61/5.40 # System time : 0.764 s
% 38.61/5.40 # Total time : 23.992 s
% 38.61/5.40 # Maximum resident set size: 1684 pages
% 38.61/5.40 % E---3.1 exiting
%------------------------------------------------------------------------------