TSTP Solution File: FLD049-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD049-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 52 ( 28 unt; 6 nHn; 52 RR)
% Number of literals : 91 ( 0 equ; 39 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 : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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.Fk4XZrPcGw/E---3.1_10377.p',associativity_multiplication_1) ).
cnf(product_10,negated_conjecture,
product(c,multiplicative_inverse(d),s),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',product_10) ).
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',existence_of_identity_multiplication) ).
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.Fk4XZrPcGw/E---3.1_10377.p',well_definedness_of_multiplicative_inverse) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',c_is_defined) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',d_is_defined) ).
cnf(not_sum_8,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',not_sum_8) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',commutativity_multiplication) ).
cnf(product_9,negated_conjecture,
product(a,multiplicative_inverse(b),s),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',product_9) ).
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.Fk4XZrPcGw/E---3.1_10377.p',existence_of_inverse_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',b_is_defined) ).
cnf(not_sum_7,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',not_sum_7) ).
cnf(product_11,negated_conjecture,
product(a,d,k),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',product_11) ).
cnf(not_product_12,negated_conjecture,
~ product(b,c,k),
file('/export/starexec/sandbox/tmp/tmp.Fk4XZrPcGw/E---3.1_10377.p',not_product_12) ).
cnf(c_0_15,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
associativity_multiplication_1 ).
cnf(c_0_16,negated_conjecture,
product(c,multiplicative_inverse(d),s),
product_10 ).
cnf(c_0_17,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_18,axiom,
( defined(multiplicative_inverse(X1))
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
well_definedness_of_multiplicative_inverse ).
cnf(c_0_19,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_20,negated_conjecture,
( product(X1,X2,s)
| ~ product(X3,multiplicative_inverse(d),X2)
| ~ product(X1,X3,c) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,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_18]) ).
cnf(c_0_22,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_23,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
not_sum_8 ).
cnf(c_0_24,hypothesis,
product(multiplicative_identity,c,c),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_25,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_26,negated_conjecture,
( product(X1,multiplicative_inverse(d),s)
| ~ product(X1,multiplicative_identity,c) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
product(a,multiplicative_inverse(b),s),
product_9 ).
cnf(c_0_28,hypothesis,
( product(X1,X2,c)
| ~ product(X3,c,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( product(multiplicative_inverse(d),X1,s)
| ~ product(X1,multiplicative_identity,c) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
product(c,multiplicative_identity,c),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_31,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_32,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_33,negated_conjecture,
( product(X1,X2,s)
| ~ product(X3,multiplicative_inverse(b),X2)
| ~ product(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_34,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_35,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
not_sum_7 ).
cnf(c_0_36,negated_conjecture,
( product(X1,s,c)
| ~ product(X1,multiplicative_inverse(d),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_37,plain,
( product(X1,multiplicative_inverse(X1),multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_38,hypothesis,
product(multiplicative_identity,a,a),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
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_33,c_0_21]),c_0_34])]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
product(a,d,k),
product_11 ).
cnf(c_0_41,negated_conjecture,
product(d,s,c),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_22])]),c_0_23]) ).
cnf(c_0_42,hypothesis,
( product(X1,X2,a)
| ~ product(X3,a,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_15,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_25,c_0_39]) ).
cnf(c_0_44,hypothesis,
product(a,multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( product(X1,X2,k)
| ~ product(X3,d,X2)
| ~ product(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_15,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
product(s,d,c),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( product(X1,s,a)
| ~ product(X1,multiplicative_inverse(b),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
( product(X1,c,k)
| ~ product(X1,s,a) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
product(b,s,a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37]),c_0_34])]),c_0_35]) ).
cnf(c_0_50,negated_conjecture,
~ product(b,c,k),
not_product_12 ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : FLD049-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n031.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 23:44:58 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/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.Fk4XZrPcGw/E---3.1_10377.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_1 with pid 10475 completed with status 0
% 0.19/0.49 # Result found by new_bool_1
% 0.19/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGUNF-FFSM11-SFFFFFNN
% 0.19/0.49 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.19/0.49 # SAT001_CO_MinMin_p005000_rr with pid 10483 completed with status 0
% 0.19/0.49 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.19/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGUNF-FFSM11-SFFFFFNN
% 0.19/0.49 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 38
% 0.19/0.49 # Removed by relevancy pruning/SinE : 11
% 0.19/0.49 # Initial clauses : 27
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 27
% 0.19/0.49 # Processed clauses : 209
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 27
% 0.19/0.49 # ...remaining for further processing : 182
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 504
% 0.19/0.49 # ...of the previous two non-redundant : 457
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 504
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 82
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 155
% 0.19/0.49 # Positive orientable unit clauses : 33
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 4
% 0.19/0.49 # Non-unit-clauses : 118
% 0.19/0.49 # Current number of unprocessed clauses: 296
% 0.19/0.49 # ...number of literals in the above : 1108
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 27
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 2322
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 1998
% 0.19/0.49 # Non-unit clause-clause subsumptions : 27
% 0.19/0.49 # Unit Clause-clause subsumption calls : 13
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 2
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 209
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 7486
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.018 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.020 s
% 0.19/0.49 # Maximum resident set size: 1804 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.020 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.023 s
% 0.19/0.49 # Maximum resident set size: 1704 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------