TSTP Solution File: RNG018-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG018-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 4 RR)
% Number of literals : 24 ( 23 equ; 3 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.p',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.p',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.p',left_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.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.nD0qQwoxYM/E---3.1_32239.p',distribute1) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.p',right_multiplicative_zero) ).
cnf(prove_distributivity,negated_conjecture,
multiply(add(x,y),additive_inverse(z)) != add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))),
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.p',prove_distributivity) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.p',distribute2) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nD0qQwoxYM/E---3.1_32239.p',right_additive_identity) ).
cnf(c_0_9,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_10,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_11,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_12,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_14,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_15,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_16,negated_conjecture,
multiply(add(x,y),additive_inverse(z)) != add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))),
prove_distributivity ).
cnf(c_0_17,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_18,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
add(multiply(X1,X2),multiply(X1,additive_inverse(X2))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15]) ).
cnf(c_0_20,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_21,negated_conjecture,
add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))) != add(multiply(x,additive_inverse(z)),multiply(y,additive_inverse(z))),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
additive_inverse(multiply(X1,X2)) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG018-6 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 19:45:38 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/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.nD0qQwoxYM/E---3.1_32239.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32373 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.50 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/0.50 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 32383 completed with status 0
% 0.20/0.50 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.50 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 16
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 16
% 0.20/0.50 # Removed in clause preprocessing : 2
% 0.20/0.50 # Initial clauses in saturation : 14
% 0.20/0.50 # Processed clauses : 50
% 0.20/0.50 # ...of these trivial : 14
% 0.20/0.50 # ...subsumed : 10
% 0.20/0.50 # ...remaining for further processing : 26
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 5
% 0.20/0.50 # Generated clauses : 261
% 0.20/0.50 # ...of the previous two non-redundant : 145
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 261
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 425
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 21
% 0.20/0.50 # Positive orientable unit clauses : 19
% 0.20/0.50 # Positive unorientable unit clauses: 2
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 100
% 0.20/0.50 # ...number of literals in the above : 100
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 7
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 35
% 0.20/0.50 # BW rewrite match successes : 28
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 2188
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1528 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.026 s
% 0.20/0.50 # System time : 0.008 s
% 0.20/0.50 # Total time : 0.034 s
% 0.20/0.50 # Maximum resident set size: 1680 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------