TSTP Solution File: RNG025-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG025-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:36:41 EDT 2024
% Result : Unsatisfiable 130.10s 17.02s
% Output : CNFRefutation 130.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 41 unt; 0 nHn; 8 RR)
% Number of literals : 49 ( 48 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply_over_add2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',multiply_over_add2) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',right_alternative) ).
cnf(add_inverse,axiom,
add(additive_inverse(X1),X1) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',add_inverse) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',commutativity_for_addition) ).
cnf(left_alternative,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',left_alternative) ).
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',associativity_for_addition) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',left_additive_identity) ).
cnf(inverse_product1,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',inverse_product1) ).
cnf(inverse_product2,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',inverse_product2) ).
cnf(right_cancellation_for_addition,axiom,
( X2 = X3
| add(X1,X2) != add(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',right_cancellation_for_addition) ).
cnf(multiply_over_add1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',multiply_over_add1) ).
cnf(sum_of_inverses,axiom,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',sum_of_inverses) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG004-0.ax',additive_inverse_additive_inverse) ).
cnf(prove_middle_law,negated_conjecture,
multiply(multiply(cy,cx),cy) != multiply(cy,multiply(cx,cy)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_middle_law) ).
cnf(c_0_14,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
multiply_over_add2 ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
right_alternative ).
cnf(c_0_16,axiom,
add(additive_inverse(X1),X1) = additive_identity,
add_inverse ).
cnf(c_0_17,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_18,plain,
add(multiply(X1,X2),multiply(X3,multiply(X2,X2))) = multiply(add(X1,multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
left_alternative ).
cnf(c_0_20,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_21,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_23,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
inverse_product1 ).
cnf(c_0_24,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
inverse_product2 ).
cnf(c_0_25,plain,
( X2 = X3
| add(X1,X2) != add(X1,X3) ),
inference(fof_simplification,[status(thm)],[right_cancellation_for_addition]) ).
cnf(c_0_26,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
multiply_over_add1 ).
cnf(c_0_27,plain,
add(multiply(X1,multiply(X1,X2)),multiply(X3,multiply(X2,X2))) = multiply(add(multiply(X1,X1),multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_29,axiom,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
sum_of_inverses ).
cnf(c_0_30,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( X2 = X3
| add(X1,X2) != add(X1,X3) ),
c_0_25 ).
cnf(c_0_32,plain,
multiply(multiply(X1,X2),additive_inverse(X2)) = multiply(X1,multiply(X2,additive_inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_24]),c_0_24]) ).
cnf(c_0_33,plain,
multiply(multiply(X1,add(X1,X2)),X2) = multiply(X1,multiply(add(X1,X2),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]),c_0_14]) ).
cnf(c_0_34,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
multiply(multiply(X1,additive_inverse(X2)),X3) = multiply(multiply(X1,X2),additive_inverse(X3)),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_37,plain,
( X1 = X2
| add(X3,X1) != add(X2,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_38,negated_conjecture,
multiply(multiply(cy,cx),cy) != multiply(cy,multiply(cx,cy)),
inference(fof_simplification,[status(thm)],[prove_middle_law]) ).
cnf(c_0_39,plain,
add(multiply(X1,multiply(X2,additive_inverse(X2))),multiply(multiply(X1,X2),X3)) = multiply(multiply(X1,X2),add(additive_inverse(X2),X3)),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_40,plain,
multiply(multiply(X1,X2),add(X1,X2)) = multiply(X1,multiply(X2,add(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),c_0_30]),c_0_36]) ).
cnf(c_0_41,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_28])]) ).
cnf(c_0_42,negated_conjecture,
multiply(multiply(cy,cx),cy) != multiply(cy,multiply(cx,cy)),
c_0_38 ).
cnf(c_0_43,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26]),c_0_26]),c_0_41]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : RNG025-1 : TPTP v8.2.0. Released v1.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.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 12:05:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 130.10/17.02 # Version: 3.1.0
% 130.10/17.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 130.10/17.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 130.10/17.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 130.10/17.02 # Starting new_bool_3 with 300s (1) cores
% 130.10/17.02 # Starting new_bool_1 with 300s (1) cores
% 130.10/17.02 # Starting sh5l with 300s (1) cores
% 130.10/17.02 # new_bool_3 with pid 2076 completed with status 0
% 130.10/17.02 # Result found by new_bool_3
% 130.10/17.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 130.10/17.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 130.10/17.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 130.10/17.02 # Starting new_bool_3 with 300s (1) cores
% 130.10/17.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 130.10/17.02 # Search class: FHUPM-FFSF21-SFFFFFNN
% 130.10/17.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 130.10/17.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 130.10/17.02 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 2082 completed with status 0
% 130.10/17.02 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 130.10/17.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 130.10/17.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 130.10/17.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 130.10/17.02 # Starting new_bool_3 with 300s (1) cores
% 130.10/17.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 130.10/17.02 # Search class: FHUPM-FFSF21-SFFFFFNN
% 130.10/17.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 130.10/17.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 130.10/17.02 # Preprocessing time : 0.002 s
% 130.10/17.02 # Presaturation interreduction done
% 130.10/17.02
% 130.10/17.02 # Proof found!
% 130.10/17.02 # SZS status Unsatisfiable
% 130.10/17.02 # SZS output start CNFRefutation
% See solution above
% 130.10/17.02 # Parsed axioms : 18
% 130.10/17.02 # Removed by relevancy pruning/SinE : 0
% 130.10/17.02 # Initial clauses : 18
% 130.10/17.02 # Removed in clause preprocessing : 0
% 130.10/17.02 # Initial clauses in saturation : 18
% 130.10/17.02 # Processed clauses : 28404
% 130.10/17.02 # ...of these trivial : 467
% 130.10/17.02 # ...subsumed : 25159
% 130.10/17.02 # ...remaining for further processing : 2778
% 130.10/17.02 # Other redundant clauses eliminated : 4287
% 130.10/17.02 # Clauses deleted for lack of memory : 0
% 130.10/17.02 # Backward-subsumed : 34
% 130.10/17.02 # Backward-rewritten : 92
% 130.10/17.02 # Generated clauses : 960750
% 130.10/17.02 # ...of the previous two non-redundant : 933769
% 130.10/17.02 # ...aggressively subsumed : 0
% 130.10/17.02 # Contextual simplify-reflections : 0
% 130.10/17.02 # Paramodulations : 956334
% 130.10/17.02 # Factorizations : 0
% 130.10/17.02 # NegExts : 0
% 130.10/17.02 # Equation resolutions : 4416
% 130.10/17.02 # Disequality decompositions : 0
% 130.10/17.02 # Total rewrite steps : 1785555
% 130.10/17.02 # ...of those cached : 1681154
% 130.10/17.02 # Propositional unsat checks : 0
% 130.10/17.02 # Propositional check models : 0
% 130.10/17.02 # Propositional check unsatisfiable : 0
% 130.10/17.02 # Propositional clauses : 0
% 130.10/17.02 # Propositional clauses after purity: 0
% 130.10/17.02 # Propositional unsat core size : 0
% 130.10/17.02 # Propositional preprocessing time : 0.000
% 130.10/17.02 # Propositional encoding time : 0.000
% 130.10/17.02 # Propositional solver time : 0.000
% 130.10/17.02 # Success case prop preproc time : 0.000
% 130.10/17.02 # Success case prop encoding time : 0.000
% 130.10/17.02 # Success case prop solver time : 0.000
% 130.10/17.02 # Current number of processed clauses : 2633
% 130.10/17.02 # Positive orientable unit clauses : 269
% 130.10/17.02 # Positive unorientable unit clauses: 66
% 130.10/17.02 # Negative unit clauses : 0
% 130.10/17.02 # Non-unit-clauses : 2298
% 130.10/17.02 # Current number of unprocessed clauses: 904547
% 130.10/17.02 # ...number of literals in the above : 1702765
% 130.10/17.02 # Current number of archived formulas : 0
% 130.10/17.02 # Current number of archived clauses : 144
% 130.10/17.02 # Clause-clause subsumption calls (NU) : 1719535
% 130.10/17.02 # Rec. Clause-clause subsumption calls : 1610577
% 130.10/17.02 # Non-unit clause-clause subsumptions : 24397
% 130.10/17.02 # Unit Clause-clause subsumption calls : 2387
% 130.10/17.02 # Rewrite failures with RHS unbound : 0
% 130.10/17.02 # BW rewrite match attempts : 5652
% 130.10/17.02 # BW rewrite match successes : 427
% 130.10/17.02 # Condensation attempts : 0
% 130.10/17.02 # Condensation successes : 0
% 130.10/17.02 # Termbank termtop insertions : 18472965
% 130.10/17.02 # Search garbage collected termcells : 8
% 130.10/17.02
% 130.10/17.02 # -------------------------------------------------
% 130.10/17.02 # User time : 15.573 s
% 130.10/17.02 # System time : 0.584 s
% 130.10/17.02 # Total time : 16.157 s
% 130.10/17.02 # Maximum resident set size: 1692 pages
% 130.10/17.02
% 130.10/17.02 # -------------------------------------------------
% 130.10/17.02 # User time : 15.576 s
% 130.10/17.02 # System time : 0.585 s
% 130.10/17.02 # Total time : 16.161 s
% 130.10/17.02 # Maximum resident set size: 1704 pages
% 130.10/17.02 % E---3.1 exiting
%------------------------------------------------------------------------------