TSTP Solution File: FLD031-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD031-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 17:30:02 EDT 2023
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 13 unt; 4 nHn; 29 RR)
% Number of literals : 54 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_inverse_multiplication,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',existence_of_inverse_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',a_is_defined) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',a_not_equal_to_additive_identity_3) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',transitivity_of_equality) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',well_definedness_of_multiplicative_inverse) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',compatibility_of_equality_and_multiplication) ).
cnf(existence_of_identity_multiplication,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',existence_of_identity_multiplication) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',symmetry_of_equality) ).
cnf(a_equals_multiplicative_identity_2,negated_conjecture,
equalish(a,multiplicative_identity),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',a_equals_multiplicative_identity_2) ).
cnf(multiplicative_inverses_not_equal,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
file('/export/starexec/sandbox2/tmp/tmp.IpP44ac1dA/E---3.1_26765.p',multiplicative_inverses_not_equal) ).
cnf(c_0_10,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_11,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_12,negated_conjecture,
~ equalish(a,additive_identity),
a_not_equal_to_additive_identity_3 ).
cnf(c_0_13,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_14,hypothesis,
equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
well_definedness_of_multiplicative_inverse ).
cnf(c_0_16,hypothesis,
( equalish(X1,multiplicative_identity)
| ~ equalish(X1,multiply(a,multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_18,hypothesis,
defined(multiplicative_inverse(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_12]) ).
cnf(c_0_19,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_20,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_21,hypothesis,
( equalish(multiply(X1,multiplicative_inverse(a)),multiplicative_identity)
| ~ equalish(X1,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
equalish(a,multiplicative_identity),
a_equals_multiplicative_identity_2 ).
cnf(c_0_23,plain,
( equalish(X1,X2)
| ~ defined(X2)
| ~ equalish(X1,multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_24,hypothesis,
( equalish(multiplicative_identity,multiply(X1,multiplicative_inverse(a)))
| ~ equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
equalish(multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_26,hypothesis,
equalish(multiplicative_identity,multiplicative_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]),c_0_25])]) ).
cnf(c_0_27,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
multiplicative_inverses_not_equal ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : FLD031-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 23:12:29 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.IpP44ac1dA/E---3.1_26765.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26843 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.17/0.46 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 0.17/0.46 # U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 26851 completed with status 0
% 0.17/0.46 # Result found by U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.17/0.46 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 31
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 31
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 31
% 0.17/0.46 # Processed clauses : 155
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 11
% 0.17/0.46 # ...remaining for further processing : 144
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 333
% 0.17/0.46 # ...of the previous two non-redundant : 252
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 333
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 114
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 113
% 0.17/0.46 # Positive orientable unit clauses : 49
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 3
% 0.17/0.46 # Non-unit-clauses : 61
% 0.17/0.46 # Current number of unprocessed clauses: 159
% 0.17/0.46 # ...number of literals in the above : 469
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 31
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 450
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 410
% 0.17/0.46 # Non-unit clause-clause subsumptions : 11
% 0.17/0.46 # Unit Clause-clause subsumption calls : 167
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 0
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 4832
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.008 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.011 s
% 0.17/0.46 # Maximum resident set size: 1648 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.046 s
% 0.17/0.46 # System time : 0.010 s
% 0.17/0.46 # Total time : 0.056 s
% 0.17/0.46 # Maximum resident set size: 1692 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------