TSTP Solution File: RNG023-7 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG023-7 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:14:45 EDT 2023
% Result : Unsatisfiable 0.17s 0.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 4 RR)
% Number of literals : 16 ( 15 equ; 3 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_left_alternative,negated_conjecture,
associator(x,x,y) != additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.g0IZTpyAhb/E---3.1_21732.p',prove_left_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.g0IZTpyAhb/E---3.1_21732.p',associator) ).
cnf(inverse_product2,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.g0IZTpyAhb/E---3.1_21732.p',inverse_product2) ).
cnf(left_alternative,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.g0IZTpyAhb/E---3.1_21732.p',left_alternative) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.g0IZTpyAhb/E---3.1_21732.p',distribute1) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.g0IZTpyAhb/E---3.1_21732.p',right_additive_inverse) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.g0IZTpyAhb/E---3.1_21732.p',right_multiplicative_zero) ).
cnf(c_0_7,negated_conjecture,
associator(x,x,y) != additive_identity,
prove_left_alternative ).
cnf(c_0_8,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_9,negated_conjecture,
add(multiply(multiply(x,x),y),additive_inverse(multiply(x,multiply(x,y)))) != additive_identity,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
inverse_product2 ).
cnf(c_0_11,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
left_alternative ).
cnf(c_0_12,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_13,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_14,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_15,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_9,c_0_10]),c_0_10]),c_0_11]),c_0_12]),c_0_12]),c_0_13]),c_0_14]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : RNG023-7 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.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:18:56 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.g0IZTpyAhb/E---3.1_21732.p
% 0.17/0.43 # Version: 3.1pre001
% 0.17/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43 # Starting sh5l with 300s (1) cores
% 0.17/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21810 completed with status 0
% 0.17/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: FUUPM-FFMF21-MFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.43 # Starting U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.43 # Starting sh5l with 136s (1) cores
% 0.17/0.43 # U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 21815 completed with status 0
% 0.17/0.43 # Result found by U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43 # No SInE strategy applied
% 0.17/0.43 # Search class: FUUPM-FFMF21-MFFFFFNN
% 0.17/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.43 # Starting U----_211g_10_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.43 # Preprocessing time : 0.001 s
% 0.17/0.43 # Presaturation interreduction done
% 0.17/0.43
% 0.17/0.43 # Proof found!
% 0.17/0.43 # SZS status Unsatisfiable
% 0.17/0.43 # SZS output start CNFRefutation
% See solution above
% 0.17/0.43 # Parsed axioms : 23
% 0.17/0.43 # Removed by relevancy pruning/SinE : 0
% 0.17/0.43 # Initial clauses : 23
% 0.17/0.43 # Removed in clause preprocessing : 2
% 0.17/0.43 # Initial clauses in saturation : 21
% 0.17/0.43 # Processed clauses : 22
% 0.17/0.43 # ...of these trivial : 3
% 0.17/0.43 # ...subsumed : 0
% 0.17/0.43 # ...remaining for further processing : 18
% 0.17/0.43 # Other redundant clauses eliminated : 0
% 0.17/0.43 # Clauses deleted for lack of memory : 0
% 0.17/0.43 # Backward-subsumed : 0
% 0.17/0.43 # Backward-rewritten : 2
% 0.17/0.43 # Generated clauses : 0
% 0.17/0.43 # ...of the previous two non-redundant : 1
% 0.17/0.43 # ...aggressively subsumed : 0
% 0.17/0.43 # Contextual simplify-reflections : 0
% 0.17/0.43 # Paramodulations : 0
% 0.17/0.43 # Factorizations : 0
% 0.17/0.43 # NegExts : 0
% 0.17/0.43 # Equation resolutions : 0
% 0.17/0.43 # Total rewrite steps : 23
% 0.17/0.43 # Propositional unsat checks : 0
% 0.17/0.43 # Propositional check models : 0
% 0.17/0.43 # Propositional check unsatisfiable : 0
% 0.17/0.43 # Propositional clauses : 0
% 0.17/0.43 # Propositional clauses after purity: 0
% 0.17/0.43 # Propositional unsat core size : 0
% 0.17/0.43 # Propositional preprocessing time : 0.000
% 0.17/0.43 # Propositional encoding time : 0.000
% 0.17/0.43 # Propositional solver time : 0.000
% 0.17/0.43 # Success case prop preproc time : 0.000
% 0.17/0.43 # Success case prop encoding time : 0.000
% 0.17/0.43 # Success case prop solver time : 0.000
% 0.17/0.43 # Current number of processed clauses : 16
% 0.17/0.43 # Positive orientable unit clauses : 15
% 0.17/0.43 # Positive unorientable unit clauses: 1
% 0.17/0.43 # Negative unit clauses : 0
% 0.17/0.43 # Non-unit-clauses : 0
% 0.17/0.43 # Current number of unprocessed clauses: 0
% 0.17/0.43 # ...number of literals in the above : 0
% 0.17/0.43 # Current number of archived formulas : 0
% 0.17/0.43 # Current number of archived clauses : 4
% 0.17/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.43 # Non-unit clause-clause subsumptions : 0
% 0.17/0.43 # Unit Clause-clause subsumption calls : 0
% 0.17/0.43 # Rewrite failures with RHS unbound : 0
% 0.17/0.43 # BW rewrite match attempts : 14
% 0.17/0.43 # BW rewrite match successes : 11
% 0.17/0.43 # Condensation attempts : 0
% 0.17/0.43 # Condensation successes : 0
% 0.17/0.43 # Termbank termtop insertions : 387
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.002 s
% 0.17/0.43 # System time : 0.002 s
% 0.17/0.43 # Total time : 0.004 s
% 0.17/0.43 # Maximum resident set size: 1588 pages
% 0.17/0.43
% 0.17/0.43 # -------------------------------------------------
% 0.17/0.43 # User time : 0.011 s
% 0.17/0.43 # System time : 0.004 s
% 0.17/0.43 # Total time : 0.015 s
% 0.17/0.43 # Maximum resident set size: 1684 pages
% 0.17/0.43 % E---3.1 exiting
% 0.17/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------