TSTP Solution File: RNG024-7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG024-7 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Sat May 4 09:14:51 EDT 2024
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 5 RR)
% Number of literals : 17 ( 16 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 24 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_right_alternative,negated_conjecture,
associator(x,y,y) != additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.4rSMNrkLmU/E---3.1_9320.p',prove_right_alternative) ).
cnf(associator,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.4rSMNrkLmU/E---3.1_9320.p',associator) ).
cnf(inverse_product2,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.4rSMNrkLmU/E---3.1_9320.p',inverse_product2) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox2/tmp/tmp.4rSMNrkLmU/E---3.1_9320.p',right_alternative) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.4rSMNrkLmU/E---3.1_9320.p',distribute1) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.4rSMNrkLmU/E---3.1_9320.p',right_additive_inverse) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.4rSMNrkLmU/E---3.1_9320.p',right_multiplicative_zero) ).
cnf(c_0_7,negated_conjecture,
associator(x,y,y) != additive_identity,
inference(fof_simplification,[status(thm)],[prove_right_alternative]) ).
cnf(c_0_8,negated_conjecture,
associator(x,y,y) != additive_identity,
c_0_7 ).
cnf(c_0_9,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_10,negated_conjecture,
add(multiply(multiply(x,y),y),additive_inverse(multiply(x,multiply(y,y)))) != additive_identity,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
inverse_product2 ).
cnf(c_0_12,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
right_alternative ).
cnf(c_0_13,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_14,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_15,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_12]),c_0_13]),c_0_13]),c_0_14]),c_0_15]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : RNG024-7 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 11:42:58 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.4rSMNrkLmU/E---3.1_9320.p
% 0.15/0.41 # Version: 3.1.0
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9397 completed with status 0
% 0.15/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FUUPM-FFMF21-MFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.41 # Starting sh5l with 136s (1) cores
% 0.15/0.41 # U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 9401 completed with status 0
% 0.15/0.41 # Result found by U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FUUPM-FFMF21-MFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 23
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 23
% 0.15/0.41 # Removed in clause preprocessing : 2
% 0.15/0.41 # Initial clauses in saturation : 21
% 0.15/0.41 # Processed clauses : 22
% 0.15/0.41 # ...of these trivial : 3
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 18
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 2
% 0.15/0.41 # Generated clauses : 0
% 0.15/0.41 # ...of the previous two non-redundant : 1
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 0
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Disequality decompositions : 0
% 0.15/0.41 # Total rewrite steps : 23
% 0.15/0.41 # ...of those cached : 3
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 16
% 0.15/0.41 # Positive orientable unit clauses : 15
% 0.15/0.41 # Positive unorientable unit clauses: 1
% 0.15/0.41 # Negative unit clauses : 0
% 0.15/0.41 # Non-unit-clauses : 0
% 0.15/0.41 # Current number of unprocessed clauses: 0
% 0.15/0.41 # ...number of literals in the above : 0
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 4
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.41 # Non-unit clause-clause subsumptions : 0
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 14
% 0.15/0.41 # BW rewrite match successes : 11
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 390
% 0.15/0.41 # Search garbage collected termcells : 2
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.004 s
% 0.15/0.41 # System time : 0.000 s
% 0.15/0.41 # Total time : 0.004 s
% 0.15/0.41 # Maximum resident set size: 1612 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.012 s
% 0.15/0.41 # System time : 0.002 s
% 0.15/0.41 # Total time : 0.015 s
% 0.15/0.41 # Maximum resident set size: 1696 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------