TSTP Solution File: RNG001-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG001-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:38 EDT 2023
% Result : Unsatisfiable 999.25s 138.73s
% Output : CNFRefutation 999.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of clauses : 59 ( 19 unt; 0 nHn; 40 RR)
% Number of literals : 135 ( 0 equ; 78 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 172 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
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.vh1Sie5fZu/E---3.1_12065.p',associativity_of_addition2) ).
cnf(additive_inverse1,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.vh1Sie5fZu/E---3.1_12065.p',additive_inverse1) ).
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.vh1Sie5fZu/E---3.1_12065.p',associativity_of_addition1) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.vh1Sie5fZu/E---3.1_12065.p',additive_identity1) ).
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.vh1Sie5fZu/E---3.1_12065.p',distributivity1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.vh1Sie5fZu/E---3.1_12065.p',closure_of_multiplication) ).
cnf(distributivity2,axiom,
( product(X1,X6,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ sum(X3,X5,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.vh1Sie5fZu/E---3.1_12065.p',distributivity2) ).
cnf(prove_a_times_additive_id_is_additive_id,negated_conjecture,
~ product(a,additive_identity,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.vh1Sie5fZu/E---3.1_12065.p',prove_a_times_additive_id_is_additive_id) ).
cnf(c_0_8,axiom,
( sum(X3,X4,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X5,X6) ),
associativity_of_addition2 ).
cnf(c_0_9,axiom,
sum(additive_inverse(X1),X1,additive_identity),
additive_inverse1 ).
cnf(c_0_10,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
associativity_of_addition1 ).
cnf(c_0_11,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_12,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_inverse(X2),X1)
| ~ sum(X4,additive_identity,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( sum(additive_identity,X1,X2)
| ~ sum(additive_inverse(additive_inverse(X1)),additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_15,plain,
( sum(additive_inverse(X1),X2,X3)
| ~ sum(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_16,plain,
( sum(additive_identity,X1,X2)
| ~ sum(additive_inverse(X1),X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( sum(additive_identity,X1,X2)
| ~ sum(X1,additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_18,plain,
( sum(additive_identity,additive_inverse(X1),X2)
| ~ sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_19,plain,
sum(additive_identity,additive_inverse(additive_inverse(X1)),X1),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_20,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_21,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_22,plain,
( sum(additive_identity,X1,X2)
| ~ sum(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_23,plain,
sum(additive_identity,additive_inverse(additive_identity),additive_identity),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_24,plain,
( sum(X1,additive_inverse(X1),X2)
| ~ sum(additive_identity,additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_25,plain,
( sum(X1,X2,additive_identity)
| ~ sum(X1,X3,additive_inverse(X4))
| ~ sum(X3,X4,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_26,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_20,c_0_21]) ).
cnf(c_0_27,plain,
sum(additive_identity,additive_identity,additive_inverse(additive_identity)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
sum(X1,additive_inverse(X1),additive_identity),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_29,plain,
( sum(additive_identity,X1,additive_identity)
| ~ sum(additive_inverse(X2),X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_30,plain,
( sum(X1,multiply(X2,X3),multiply(X2,X4))
| ~ product(X2,X5,X1)
| ~ sum(X5,X3,X4) ),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_31,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_inverse(additive_inverse(X3)),X2)
| ~ sum(X1,X4,additive_identity) ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_32,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_identity,X1)
| ~ sum(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_33,plain,
sum(X1,additive_inverse(X1),additive_inverse(additive_identity)),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_34,plain,
( sum(X1,X2,X3)
| ~ sum(additive_inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_35,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_inverse(X5),X1)
| ~ sum(X4,X6,X3)
| ~ sum(X5,X6,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_36,plain,
( sum(additive_identity,X1,additive_identity)
| ~ sum(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_37,plain,
( sum(multiply(X1,X2),multiply(X1,X3),multiply(X1,X4))
| ~ sum(X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_38,plain,
( sum(X1,additive_identity,X2)
| ~ sum(X1,additive_inverse(X2),additive_identity) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_39,plain,
( sum(additive_inverse(additive_identity),X1,X2)
| ~ sum(additive_identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_40,plain,
( sum(additive_inverse(additive_identity),X1,X2)
| ~ sum(X1,additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_41,plain,
sum(X1,additive_identity,X1),
inference(spm,[status(thm)],[c_0_34,c_0_9]) ).
cnf(c_0_42,plain,
( sum(X1,X2,X3)
| ~ sum(additive_inverse(X1),X4,X2)
| ~ sum(additive_identity,X4,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_43,plain,
( sum(additive_identity,multiply(X1,X2),additive_identity)
| ~ sum(X3,X2,X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( sum(additive_inverse(additive_identity),additive_identity,X1)
| ~ sum(additive_identity,additive_inverse(X1),additive_identity) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( sum(X1,X2,X3)
| ~ sum(additive_inverse(X4),X2,X3)
| ~ sum(X4,X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_46,plain,
sum(additive_inverse(additive_identity),X1,X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( sum(X1,X2,X3)
| ~ sum(additive_identity,X4,X3)
| ~ sum(X1,X2,X4) ),
inference(spm,[status(thm)],[c_0_42,c_0_15]) ).
cnf(c_0_48,plain,
sum(additive_identity,multiply(X1,additive_identity),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_19])]) ).
cnf(c_0_49,plain,
( sum(X1,X2,X2)
| ~ sum(additive_identity,X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,axiom,
( product(X1,X6,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ sum(X3,X5,X7) ),
distributivity2 ).
cnf(c_0_51,plain,
( sum(X1,X2,additive_identity)
| ~ sum(X1,X2,multiply(X3,additive_identity)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
sum(multiply(X1,additive_identity),X2,X2),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_53,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X5,multiply(X1,X6),X3)
| ~ sum(X4,X6,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_21]) ).
cnf(c_0_54,plain,
sum(multiply(X1,additive_identity),multiply(X2,additive_identity),additive_identity),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
( product(X1,X2,additive_identity)
| ~ product(X1,X3,multiply(X4,additive_identity))
| ~ sum(X3,additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ product(a,additive_identity,additive_identity),
prove_a_times_additive_id_is_additive_id ).
cnf(c_0_57,plain,
( product(X1,X2,additive_identity)
| ~ sum(additive_identity,additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_21]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : RNG001-3 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.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:10:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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/tmp/tmp.vh1Sie5fZu/E---3.1_12065.p
% 999.25/138.73 # Version: 3.1pre001
% 999.25/138.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 999.25/138.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 999.25/138.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 999.25/138.73 # Starting new_bool_3 with 300s (1) cores
% 999.25/138.73 # Starting new_bool_1 with 300s (1) cores
% 999.25/138.73 # Starting sh5l with 300s (1) cores
% 999.25/138.73 # new_bool_3 with pid 12191 completed with status 8
% 999.25/138.73 # new_bool_1 with pid 12192 completed with status 8
% 999.25/138.73 # sh5l with pid 12193 completed with status 0
% 999.25/138.73 # Result found by sh5l
% 999.25/138.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 999.25/138.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 999.25/138.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 999.25/138.73 # Starting new_bool_3 with 300s (1) cores
% 999.25/138.73 # Starting new_bool_1 with 300s (1) cores
% 999.25/138.73 # Starting sh5l with 300s (1) cores
% 999.25/138.73 # SinE strategy is gf500_gu_R04_F100_L20000
% 999.25/138.73 # Search class: FHUNS-FFSF21-SFFFFFNN
% 999.25/138.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 999.25/138.73 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 999.25/138.73 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 12202 completed with status 0
% 999.25/138.73 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 999.25/138.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 999.25/138.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 999.25/138.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 999.25/138.73 # Starting new_bool_3 with 300s (1) cores
% 999.25/138.73 # Starting new_bool_1 with 300s (1) cores
% 999.25/138.73 # Starting sh5l with 300s (1) cores
% 999.25/138.73 # SinE strategy is gf500_gu_R04_F100_L20000
% 999.25/138.73 # Search class: FHUNS-FFSF21-SFFFFFNN
% 999.25/138.73 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 999.25/138.73 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 999.25/138.73 # Preprocessing time : 0.001 s
% 999.25/138.73 # Presaturation interreduction done
% 999.25/138.73
% 999.25/138.73 # Proof found!
% 999.25/138.73 # SZS status Unsatisfiable
% 999.25/138.73 # SZS output start CNFRefutation
% See solution above
% 999.25/138.73 # Parsed axioms : 8
% 999.25/138.73 # Removed by relevancy pruning/SinE : 0
% 999.25/138.73 # Initial clauses : 8
% 999.25/138.73 # Removed in clause preprocessing : 0
% 999.25/138.73 # Initial clauses in saturation : 8
% 999.25/138.73 # Processed clauses : 278373
% 999.25/138.73 # ...of these trivial : 3569
% 999.25/138.73 # ...subsumed : 261574
% 999.25/138.73 # ...remaining for further processing : 13230
% 999.25/138.73 # Other redundant clauses eliminated : 0
% 999.25/138.73 # Clauses deleted for lack of memory : 369356
% 999.25/138.73 # Backward-subsumed : 1030
% 999.25/138.73 # Backward-rewritten : 98
% 999.25/138.73 # Generated clauses : 8333311
% 999.25/138.73 # ...of the previous two non-redundant : 7096636
% 999.25/138.73 # ...aggressively subsumed : 0
% 999.25/138.73 # Contextual simplify-reflections : 0
% 999.25/138.73 # Paramodulations : 8333311
% 999.25/138.73 # Factorizations : 0
% 999.25/138.73 # NegExts : 0
% 999.25/138.73 # Equation resolutions : 0
% 999.25/138.73 # Total rewrite steps : 4239563
% 999.25/138.73 # Propositional unsat checks : 2
% 999.25/138.73 # Propositional check models : 1
% 999.25/138.73 # Propositional check unsatisfiable : 0
% 999.25/138.73 # Propositional clauses : 0
% 999.25/138.73 # Propositional clauses after purity: 0
% 999.25/138.73 # Propositional unsat core size : 0
% 999.25/138.73 # Propositional preprocessing time : 0.000
% 999.25/138.73 # Propositional encoding time : 3.006
% 999.25/138.73 # Propositional solver time : 9.279
% 999.25/138.73 # Success case prop preproc time : 0.000
% 999.25/138.73 # Success case prop encoding time : 0.000
% 999.25/138.73 # Success case prop solver time : 0.000
% 999.25/138.73 # Current number of processed clauses : 12094
% 999.25/138.73 # Positive orientable unit clauses : 501
% 999.25/138.73 # Positive unorientable unit clauses: 0
% 999.25/138.73 # Negative unit clauses : 1
% 999.25/138.73 # Non-unit-clauses : 11592
% 999.25/138.73 # Current number of unprocessed clauses: 1375582
% 999.25/138.73 # ...number of literals in the above : 3213397
% 999.25/138.73 # Current number of archived formulas : 0
% 999.25/138.73 # Current number of archived clauses : 1136
% 999.25/138.73 # Clause-clause subsumption calls (NU) : 151983721
% 999.25/138.73 # Rec. Clause-clause subsumption calls : 95947484
% 999.25/138.73 # Non-unit clause-clause subsumptions : 262604
% 999.25/138.73 # Unit Clause-clause subsumption calls : 5535
% 999.25/138.73 # Rewrite failures with RHS unbound : 0
% 999.25/138.73 # BW rewrite match attempts : 57792
% 999.25/138.73 # BW rewrite match successes : 98
% 999.25/138.73 # Condensation attempts : 0
% 999.25/138.73 # Condensation successes : 0
% 999.25/138.73 # Termbank termtop insertions : 141011682
% 999.25/138.73
% 999.25/138.73 # -------------------------------------------------
% 999.25/138.73 # User time : 135.640 s
% 999.25/138.73 # System time : 1.967 s
% 999.25/138.73 # Total time : 137.607 s
% 999.25/138.73 # Maximum resident set size: 1644 pages
% 999.25/138.73
% 999.25/138.73 # -------------------------------------------------
% 999.25/138.73 # User time : 311.649 s
% 999.25/138.73 # System time : 2.005 s
% 999.25/138.73 # Total time : 313.654 s
% 999.25/138.73 # Maximum resident set size: 1680 pages
% 999.25/138.73 % E---3.1 exiting
% 999.25/138.73 % E---3.1 exiting
%------------------------------------------------------------------------------