TSTP Solution File: FLD010-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : FLD010-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Mon May 20 19:52:56 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 11 unt; 9 nHn; 30 RR)
% Number of literals : 59 ( 0 equ; 27 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 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/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(existence_of_identity_multiplication,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(well_definedness_of_multiplicative_identity,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_identity) ).
cnf(multiplicative_inv_not_equal_to_multiplicative_id_2,negated_conjecture,
~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_inv_not_equal_to_multiplicative_id_2) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(different_identities,axiom,
~ equalish(additive_identity,multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',different_identities) ).
cnf(c_0_8,plain,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_9,plain,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_10,plain,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_11,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_12,plain,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
c_0_8 ).
cnf(c_0_13,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_14,negated_conjecture,
~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
inference(fof_simplification,[status(thm)],[multiplicative_inv_not_equal_to_multiplicative_id_2]) ).
cnf(c_0_15,plain,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_16,plain,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
c_0_9 ).
cnf(c_0_17,plain,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
c_0_10 ).
cnf(c_0_18,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
c_0_11 ).
cnf(c_0_19,plain,
( equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_identity)
| equalish(multiplicative_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
c_0_14 ).
cnf(c_0_21,plain,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
c_0_15 ).
cnf(c_0_22,plain,
( equalish(X1,X2)
| ~ defined(X2)
| ~ equalish(X1,multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( equalish(multiplicative_identity,multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)))
| equalish(multiplicative_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ equalish(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,plain,
( defined(multiplicative_inverse(multiplicative_identity))
| equalish(multiplicative_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_26,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(fof_simplification,[status(thm)],[different_identities]) ).
cnf(c_0_27,plain,
equalish(multiplicative_identity,additive_identity),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
~ equalish(additive_identity,multiplicative_identity),
c_0_26 ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD010-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n020.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sat May 18 21:45:38 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 5193 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGUNF-FFMF21-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 181s (1) cores
% 0.20/0.51 # G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with pid 5198 completed with status 0
% 0.20/0.51 # Result found by G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGUNF-FFMF21-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 28
% 0.20/0.52 # Removed by relevancy pruning/SinE : 2
% 0.20/0.52 # Initial clauses : 26
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 26
% 0.20/0.52 # Processed clauses : 39
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 4
% 0.20/0.52 # ...remaining for further processing : 35
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 3
% 0.20/0.52 # Generated clauses : 67
% 0.20/0.52 # ...of the previous two non-redundant : 61
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 1
% 0.20/0.52 # Paramodulations : 65
% 0.20/0.52 # Factorizations : 2
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 4
% 0.20/0.52 # ...of those cached : 2
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 32
% 0.20/0.52 # Positive orientable unit clauses : 3
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 3
% 0.20/0.52 # Non-unit-clauses : 26
% 0.20/0.52 # Current number of unprocessed clauses: 48
% 0.20/0.52 # ...number of literals in the above : 170
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 3
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 112
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 96
% 0.20/0.52 # Non-unit clause-clause subsumptions : 5
% 0.20/0.52 # Unit Clause-clause subsumption calls : 2
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 1
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 39
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 1786
% 0.20/0.52 # Search garbage collected termcells : 77
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.005 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.007 s
% 0.20/0.52 # Maximum resident set size: 1720 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.005 s
% 0.20/0.52 # System time : 0.006 s
% 0.20/0.52 # Total time : 0.011 s
% 0.20/0.52 # Maximum resident set size: 1720 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------