TSTP Solution File: RNG008-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG008-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:19 EDT 2023
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 7 RR)
% Number of literals : 37 ( 36 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply_additive_inverse2,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',multiply_additive_inverse2) ).
cnf(multiply_additive_inverse1,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',multiply_additive_inverse1) ).
cnf(boolean_ring,hypothesis,
multiply(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',boolean_ring) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',additive_inverse_additive_inverse) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',distribute1) ).
cnf(a_times_b_is_c,negated_conjecture,
multiply(a,b) = c,
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',a_times_b_is_c) ).
cnf(commutative_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',commutative_addition) ).
cnf(right_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',right_inverse) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',distribute2) ).
cnf(associative_addition,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',associative_addition) ).
cnf(left_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',left_identity) ).
cnf(right_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',right_identity) ).
cnf(prove_commutativity,negated_conjecture,
multiply(b,a) != c,
file('/export/starexec/sandbox2/tmp/tmp.jAUo6YypE1/E---3.1_4384.p',prove_commutativity) ).
cnf(c_0_13,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
multiply_additive_inverse2 ).
cnf(c_0_14,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
multiply_additive_inverse1 ).
cnf(c_0_15,hypothesis,
multiply(X1,X1) = X1,
boolean_ring ).
cnf(c_0_16,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_18,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_19,negated_conjecture,
multiply(a,b) = c,
a_times_b_is_c ).
cnf(c_0_20,axiom,
add(X1,X2) = add(X2,X1),
commutative_addition ).
cnf(c_0_21,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_inverse ).
cnf(c_0_22,hypothesis,
additive_inverse(X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_15]) ).
cnf(c_0_23,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_24,negated_conjecture,
add(c,multiply(a,X1)) = multiply(a,add(X1,b)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associative_addition ).
cnf(c_0_26,plain,
add(X1,X1) = additive_identity,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
add(additive_identity,X1) = X1,
left_identity ).
cnf(c_0_28,hypothesis,
add(X1,multiply(X2,X1)) = multiply(add(X2,X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_20]) ).
cnf(c_0_29,hypothesis,
multiply(a,add(a,b)) = add(a,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_20]) ).
cnf(c_0_30,plain,
add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_31,plain,
add(X1,add(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_32,hypothesis,
add(X1,multiply(X1,X2)) = multiply(X1,add(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_20]) ).
cnf(c_0_33,hypothesis,
multiply(b,add(a,b)) = add(b,c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_30]),c_0_20]),c_0_31]),c_0_31]) ).
cnf(c_0_34,axiom,
add(X1,additive_identity) = X1,
right_identity ).
cnf(c_0_35,negated_conjecture,
multiply(b,a) != c,
prove_commutativity ).
cnf(c_0_36,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31]),c_0_25]),c_0_26]),c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG008-3 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n004.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 19:42:45 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.jAUo6YypE1/E---3.1_4384.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4462 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 # Starting sh5l with 136s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4468 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Unsatisfiable
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 19
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 19
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 19
% 0.16/0.44 # Processed clauses : 92
% 0.16/0.44 # ...of these trivial : 9
% 0.16/0.44 # ...subsumed : 9
% 0.16/0.44 # ...remaining for further processing : 74
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 11
% 0.16/0.44 # Generated clauses : 564
% 0.16/0.44 # ...of the previous two non-redundant : 310
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 564
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 834
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 45
% 0.16/0.44 # Positive orientable unit clauses : 42
% 0.16/0.44 # Positive unorientable unit clauses: 2
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 0
% 0.16/0.44 # Current number of unprocessed clauses: 240
% 0.16/0.44 # ...number of literals in the above : 240
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 29
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 1
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 66
% 0.16/0.44 # BW rewrite match successes : 30
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 5695
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.006 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.009 s
% 0.16/0.44 # Maximum resident set size: 1524 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.035 s
% 0.16/0.44 # System time : 0.006 s
% 0.16/0.44 # Total time : 0.041 s
% 0.16/0.44 # Maximum resident set size: 1672 pages
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------