TSTP Solution File: RNG012-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG012-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:21 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 3 RR)
% Number of literals : 31 ( 30 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 56 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',left_additive_identity) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',commutativity_for_addition) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',distribute1) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',distribute2) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',right_multiplicative_zero) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',right_additive_identity) ).
cnf(left_multiplicative_zero,axiom,
multiply(additive_identity,X1) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',left_multiplicative_zero) ).
cnf(prove_equation,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',prove_equation) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p',additive_inverse_additive_inverse) ).
cnf(c_0_11,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_12,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_13,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_14,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_16,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_17,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
add(multiply(X1,X2),add(multiply(X1,X3),X4)) = add(multiply(X1,add(X2,X3)),X4),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_20,plain,
add(additive_inverse(multiply(X1,X2)),multiply(X1,add(X2,X3))) = multiply(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
cnf(c_0_21,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_22,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_23,plain,
add(multiply(X1,X2),add(multiply(X3,X2),X4)) = add(multiply(add(X1,X3),X2),X4),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_24,plain,
additive_inverse(multiply(X1,X2)) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
add(multiply(X1,additive_inverse(X2)),multiply(add(X1,X3),X2)) = multiply(X3,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_24]),c_0_15]) ).
cnf(c_0_26,axiom,
multiply(additive_identity,X1) = additive_identity,
left_multiplicative_zero ).
cnf(c_0_27,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
prove_equation ).
cnf(c_0_28,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_26]),c_0_22]) ).
cnf(c_0_29,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : RNG012-6 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.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:55:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.J9bYIBxvew/E---3.1_25641.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 25771 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.54 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25776 completed with status 0
% 0.21/0.54 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 16
% 0.21/0.54 # Removed by relevancy pruning/SinE : 2
% 0.21/0.54 # Initial clauses : 14
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 14
% 0.21/0.54 # Processed clauses : 512
% 0.21/0.54 # ...of these trivial : 162
% 0.21/0.54 # ...subsumed : 264
% 0.21/0.54 # ...remaining for further processing : 86
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 12
% 0.21/0.54 # Generated clauses : 3209
% 0.21/0.54 # ...of the previous two non-redundant : 2423
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 3209
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Total rewrite steps : 4775
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 61
% 0.21/0.54 # Positive orientable unit clauses : 54
% 0.21/0.54 # Positive unorientable unit clauses: 7
% 0.21/0.54 # Negative unit clauses : 0
% 0.21/0.54 # Non-unit-clauses : 0
% 0.21/0.54 # Current number of unprocessed clauses: 1901
% 0.21/0.54 # ...number of literals in the above : 1901
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 25
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.54 # Non-unit clause-clause subsumptions : 0
% 0.21/0.54 # Unit Clause-clause subsumption calls : 26
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 149
% 0.21/0.54 # BW rewrite match successes : 102
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 36037
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.040 s
% 0.21/0.54 # System time : 0.003 s
% 0.21/0.54 # Total time : 0.043 s
% 0.21/0.54 # Maximum resident set size: 1624 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.041 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.046 s
% 0.21/0.54 # Maximum resident set size: 1684 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------