TSTP Solution File: FLD037-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD037-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:04 EDT 2023
% Result : Unsatisfiable 0.38s 0.55s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 12 unt; 4 nHn; 25 RR)
% Number of literals : 46 ( 0 equ; 21 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 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.j0u0mhXFaa/E---3.1_18367.p',existence_of_inverse_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.j0u0mhXFaa/E---3.1_18367.p',a_is_defined) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.j0u0mhXFaa/E---3.1_18367.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.j0u0mhXFaa/E---3.1_18367.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.j0u0mhXFaa/E---3.1_18367.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.j0u0mhXFaa/E---3.1_18367.p',compatibility_of_equality_and_multiplication) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.j0u0mhXFaa/E---3.1_18367.p',symmetry_of_equality) ).
cnf(a_equals_b_4,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/tmp/tmp.j0u0mhXFaa/E---3.1_18367.p',a_equals_b_4) ).
cnf(multiplicative_identity_not_equal_to_multiply_5,negated_conjecture,
~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
file('/export/starexec/sandbox2/tmp/tmp.j0u0mhXFaa/E---3.1_18367.p',multiplicative_identity_not_equal_to_multiply_5) ).
cnf(c_0_9,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_10,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_11,negated_conjecture,
~ equalish(a,additive_identity),
a_not_equal_to_additive_identity_3 ).
cnf(c_0_12,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_13,hypothesis,
equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
well_definedness_of_multiplicative_inverse ).
cnf(c_0_15,hypothesis,
( equalish(X1,multiplicative_identity)
| ~ equalish(X1,multiply(a,multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_17,hypothesis,
defined(multiplicative_inverse(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_11]) ).
cnf(c_0_18,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_19,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_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
equalish(a,b),
a_equals_b_4 ).
cnf(c_0_21,negated_conjecture,
~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
multiplicative_identity_not_equal_to_multiply_5 ).
cnf(c_0_22,hypothesis,
( equalish(multiplicative_identity,multiply(X1,multiplicative_inverse(a)))
| ~ equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
equalish(b,a),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : FLD037-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 23:35:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 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.j0u0mhXFaa/E---3.1_18367.p
% 0.38/0.55 # Version: 3.1pre001
% 0.38/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.55 # Starting sh5l with 300s (1) cores
% 0.38/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18467 completed with status 0
% 0.38/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.55 # No SInE strategy applied
% 0.38/0.55 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.38/0.55 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.55 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.55 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.55 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 0.38/0.55 # U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 18473 completed with status 0
% 0.38/0.55 # Result found by U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.55 # No SInE strategy applied
% 0.38/0.55 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.38/0.55 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.38/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.55 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.38/0.55 # Preprocessing time : 0.001 s
% 0.38/0.55 # Presaturation interreduction done
% 0.38/0.55
% 0.38/0.55 # Proof found!
% 0.38/0.55 # SZS status Unsatisfiable
% 0.38/0.55 # SZS output start CNFRefutation
% See solution above
% 0.38/0.55 # Parsed axioms : 32
% 0.38/0.55 # Removed by relevancy pruning/SinE : 0
% 0.38/0.55 # Initial clauses : 32
% 0.38/0.55 # Removed in clause preprocessing : 0
% 0.38/0.55 # Initial clauses in saturation : 32
% 0.38/0.55 # Processed clauses : 120
% 0.38/0.55 # ...of these trivial : 0
% 0.38/0.55 # ...subsumed : 5
% 0.38/0.55 # ...remaining for further processing : 115
% 0.38/0.55 # Other redundant clauses eliminated : 0
% 0.38/0.55 # Clauses deleted for lack of memory : 0
% 0.38/0.55 # Backward-subsumed : 0
% 0.38/0.55 # Backward-rewritten : 0
% 0.38/0.55 # Generated clauses : 202
% 0.38/0.55 # ...of the previous two non-redundant : 164
% 0.38/0.55 # ...aggressively subsumed : 0
% 0.38/0.55 # Contextual simplify-reflections : 0
% 0.38/0.55 # Paramodulations : 202
% 0.38/0.55 # Factorizations : 0
% 0.38/0.55 # NegExts : 0
% 0.38/0.55 # Equation resolutions : 0
% 0.38/0.55 # Total rewrite steps : 45
% 0.38/0.55 # Propositional unsat checks : 0
% 0.38/0.55 # Propositional check models : 0
% 0.38/0.55 # Propositional check unsatisfiable : 0
% 0.38/0.55 # Propositional clauses : 0
% 0.38/0.55 # Propositional clauses after purity: 0
% 0.38/0.55 # Propositional unsat core size : 0
% 0.38/0.55 # Propositional preprocessing time : 0.000
% 0.38/0.55 # Propositional encoding time : 0.000
% 0.38/0.55 # Propositional solver time : 0.000
% 0.38/0.55 # Success case prop preproc time : 0.000
% 0.38/0.55 # Success case prop encoding time : 0.000
% 0.38/0.55 # Success case prop solver time : 0.000
% 0.38/0.55 # Current number of processed clauses : 83
% 0.38/0.55 # Positive orientable unit clauses : 30
% 0.38/0.55 # Positive unorientable unit clauses: 0
% 0.38/0.55 # Negative unit clauses : 3
% 0.38/0.55 # Non-unit-clauses : 50
% 0.38/0.55 # Current number of unprocessed clauses: 106
% 0.38/0.55 # ...number of literals in the above : 319
% 0.38/0.55 # Current number of archived formulas : 0
% 0.38/0.55 # Current number of archived clauses : 32
% 0.38/0.55 # Clause-clause subsumption calls (NU) : 369
% 0.38/0.55 # Rec. Clause-clause subsumption calls : 325
% 0.38/0.55 # Non-unit clause-clause subsumptions : 5
% 0.38/0.55 # Unit Clause-clause subsumption calls : 149
% 0.38/0.55 # Rewrite failures with RHS unbound : 0
% 0.38/0.55 # BW rewrite match attempts : 0
% 0.38/0.55 # BW rewrite match successes : 0
% 0.38/0.55 # Condensation attempts : 0
% 0.38/0.55 # Condensation successes : 0
% 0.38/0.55 # Termbank termtop insertions : 3254
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.009 s
% 0.38/0.55 # System time : 0.002 s
% 0.38/0.55 # Total time : 0.011 s
% 0.38/0.55 # Maximum resident set size: 1656 pages
% 0.38/0.55
% 0.38/0.55 # -------------------------------------------------
% 0.38/0.55 # User time : 0.044 s
% 0.38/0.55 # System time : 0.009 s
% 0.38/0.55 # Total time : 0.053 s
% 0.38/0.55 # Maximum resident set size: 1696 pages
% 0.38/0.55 % E---3.1 exiting
% 0.38/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------