TSTP Solution File: FLD050-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD050-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:40 EDT 2023
% Result : Timeout 0.56s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of clauses : 55 ( 31 unt; 5 nHn; 55 RR)
% Number of literals : 96 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',existence_of_identity_multiplication) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',c_is_defined) ).
cnf(associativity_multiplication_1,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',associativity_multiplication_1) ).
cnf(product_11,negated_conjecture,
product(b,c,k),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',product_11) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',commutativity_multiplication) ).
cnf(existence_of_inverse_multiplication,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',existence_of_inverse_multiplication) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',b_is_defined) ).
cnf(not_sum_7,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',not_sum_7) ).
cnf(product_9,negated_conjecture,
product(a,multiplicative_inverse(b),s),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',product_9) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( defined(multiplicative_inverse(X1))
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',well_definedness_of_multiplicative_inverse) ).
cnf(associativity_multiplication_2,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X5,X2,X6)
| ~ product(X4,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',associativity_multiplication_2) ).
cnf(product_10,negated_conjecture,
product(a,d,k),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',product_10) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',a_is_defined) ).
cnf(s_is_defined,hypothesis,
defined(s),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',s_is_defined) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',d_is_defined) ).
cnf(not_product_12,negated_conjecture,
~ product(c,multiplicative_inverse(d),s),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',not_product_12) ).
cnf(not_sum_8,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p',not_sum_8) ).
cnf(c_0_17,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_18,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_19,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
associativity_multiplication_1 ).
cnf(c_0_20,hypothesis,
product(multiplicative_identity,c,c),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
( product(X1,X2,c)
| ~ product(X3,c,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
product(b,c,k),
product_11 ).
cnf(c_0_23,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_24,negated_conjecture,
( product(X1,k,c)
| ~ product(X1,b,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( product(k,X1,c)
| ~ product(X1,b,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_27,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_28,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
not_sum_7 ).
cnf(c_0_29,negated_conjecture,
product(a,multiplicative_inverse(b),s),
product_9 ).
cnf(c_0_30,axiom,
( defined(multiplicative_inverse(X1))
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
well_definedness_of_multiplicative_inverse ).
cnf(c_0_31,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X5,X2,X6)
| ~ product(X4,X6,X3) ),
associativity_multiplication_2 ).
cnf(c_0_32,negated_conjecture,
product(a,d,k),
product_10 ).
cnf(c_0_33,negated_conjecture,
product(k,multiplicative_inverse(b),c),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( product(X1,X2,s)
| ~ product(X3,multiplicative_inverse(b),X2)
| ~ product(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_35,plain,
( product(multiplicative_identity,multiplicative_inverse(X1),multiplicative_inverse(X1))
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_36,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_37,negated_conjecture,
( product(X1,d,X2)
| ~ product(X3,k,X2)
| ~ product(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
product(multiplicative_inverse(b),k,c),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( product(X1,multiplicative_inverse(b),s)
| ~ product(X1,multiplicative_identity,a) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27])]),c_0_28]) ).
cnf(c_0_40,hypothesis,
product(multiplicative_identity,a,a),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_41,hypothesis,
defined(s),
s_is_defined ).
cnf(c_0_42,negated_conjecture,
( product(X1,d,c)
| ~ product(multiplicative_inverse(b),a,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( product(multiplicative_inverse(b),X1,s)
| ~ product(X1,multiplicative_identity,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_44,hypothesis,
product(a,multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_45,hypothesis,
product(multiplicative_identity,s,s),
inference(spm,[status(thm)],[c_0_17,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
product(s,d,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_47,hypothesis,
( product(X1,X2,s)
| ~ product(X3,s,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
product(d,s,c),
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_49,hypothesis,
( product(X1,c,s)
| ~ product(X1,d,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,hypothesis,
( product(c,X1,s)
| ~ product(X1,d,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_51,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_52,negated_conjecture,
~ product(c,multiplicative_inverse(d),s),
not_product_12 ).
cnf(c_0_53,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
not_sum_8 ).
cnf(c_0_54,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_26]),c_0_51])]),c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : FLD050-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n024.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:22:26 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.T1oZNEgxfd/E---3.1_19517.p
% 0.56/300.10 # Version: 3.1pre001
% 0.56/300.10 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.56/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.56/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.56/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.56/300.10 # Starting sh5l with 300s (1) cores
% 0.56/300.10 # new_bool_3 with pid 19597 completed with status 0
% 0.56/300.10 # Result found by new_bool_3
% 0.56/300.10 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.56/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.56/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.56/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.56/300.10 # Search class: FGUNF-FFSM11-SFFFFFNN
% 0.56/300.10 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.56/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.56/300.10 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.56/300.10 # SAT001_CO_MinMin_p005000_rr with pid 19601 completed with status 0
% 0.56/300.10 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.56/300.10 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.56/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/300.10 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.56/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.56/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.56/300.10 # Search class: FGUNF-FFSM11-SFFFFFNN
% 0.56/300.10 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.56/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.56/300.10 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.56/300.10 # Preprocessing time : 0.001 s
% 0.56/300.10 # Presaturation interreduction done
% 0.56/300.10
% 0.56/300.10 # Proof found!
% 0.56/300.10 # SZS status Unsatisfiable
% 0.56/300.10 # SZS output start CNFRefutation
% See solution above
% 0.56/300.10 # Parsed axioms : 38
% 0.56/300.10 # Removed by relevancy pruning/SinE : 11
% 0.56/300.10 # Initial clauses : 27
% 0.56/300.10 # Removed in clause preprocessing : 0
% 0.56/300.10 # Initial clauses in saturation : 27
% 0.56/300.10 # Processed clauses : 283
% 0.56/300.10 # ...of these trivial : 2
% 0.56/300.10 # ...subsumed : 41
% 0.56/300.10 # ...remaining for further processing : 240
% 0.56/300.10 # Other redundant clauses eliminated : 0
% 0.56/300.10 # Clauses deleted for lack of memory : 0
% 0.56/300.10 # Backward-subsumed : 0
% 0.56/300.10 # Backward-rewritten : 0
% 0.56/300.10 # Generated clauses : 724
% 0.56/300.10 # ...of the previous two non-redundant : 676
% 0.56/300.10 # ...aggressively subsumed : 0
% 0.56/300.10 # Contextual simplify-reflections : 0
% 0.56/300.10 # Paramodulations : 724
% 0.56/300.10 # Factorizations : 0
% 0.56/300.10 # NegExts : 0
% 0.56/300.10 # Equation resolutions : 0
% 0.56/300.10 # Total rewrite steps : 105
% 0.56/300.10 # Propositional unsat checks : 0
% 0.56/300.10 # Propositional check models : 0
% 0.56/300.10 # Propositional check unsatisfiable : 0
% 0.56/300.10 # Propositional clauses : 0
% 0.56/300.10 # Propositional clauses after purity: 0
% 0.56/300.10 # Propositional unsat core size : 0
% 0.56/300.10 # Propositional preprocessing time : 0.000
% 0.56/300.10 # Propositional encoding time : 0.000
% 0.56/300.10 # Propositional solver time : 0.000
% 0.56/300.10 # Success case prop preproc time : 0.000
% 0.56/300.10 # Success case prop encoding time : 0.000
% 0.56/300.10 # Success case prop solver time : 0.000
% 0.56/300.10 # Current number of processed clauses : 213
% 0.56/300.10 # Positive orientable unit clauses : 36
% 0.56/300.10 # Positive unorientable unit clauses: 0
% 0.56/300.10 # Negative unit clauses : 4
% 0.56/300.10 # Non-unit-clauses : 173
% 0.56/300.10 # Current number of unprocessed clauses: 447
% 0.56/300.10 # ...number of literals in the above : 1708
% 0.56/300.10 # Current number of archived formulas : 0
% 0.56/300.10 # Current number of archived clauses : 27
% 0.56/300.10 # Clause-clause subsumption calls (NU) : 5711
% 0.56/300.10 # Rec. Clause-clause subsumption calls : 4590
% 0.56/300.10 # Non-unit clause-clause subsumptions : 41
% 0.56/300.10 # Unit Clause-clause subsumption calls : 82
% 0.56/300.10 # Rewrite failures with RHS unbound : 0
% 0.56/300.10 # BW rewrite match attempts : 6
% 0.56/300.10 # BW rewrite match successes : 0
% 0.56/300.10 # Condensation attempts : 283
% 0.56/300.10 # Condensation successes : 0
% 0.56/300.10 # Termbank termtop insertions : 10390
% 0.56/300.10
% 0.56/300.10 # -------------------------------------------------
% 0.56/300.10 # User time : 0.021 s
% 0.56/300.10 # System time : 0.002 s
% 0.56/300.10 # Total time : 0.023 s
% 0.56/300.10 # Maximum resident set size: 1812 pages
% 0.56/300.10
% 0.56/300.10 # -------------------------------------------------
% 0.56/300.10 # User time : 0.022 s
% 0.56/300.10 # System time : 0.005 s
% 0.56/300.10 # Total time : 0.027 s
% 0.56/300.10 # Maximum resident set size: 1704 pages
% 0.56/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------