TSTP Solution File: FLD001-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD001-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:24 EDT 2023
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 17 unt; 0 nHn; 37 RR)
% Number of literals : 78 ( 0 equ; 43 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_addition_1,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',associativity_addition_1) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',existence_of_identity_addition) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',commutativity_addition) ).
cnf(sum_3,hypothesis,
sum(additive_identity,a,b),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',sum_3) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',well_definedness_of_additive_identity) ).
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',existence_of_identity_multiplication) ).
cnf(associativity_addition_2,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',associativity_addition_2) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',a_is_defined) ).
cnf(distributivity_2,axiom,
( product(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ product(X4,X2,X6)
| ~ product(X5,X2,X7)
| ~ sum(X6,X7,X3) ),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',distributivity_2) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',commutativity_multiplication) ).
cnf(not_product_4,negated_conjecture,
~ product(multiplicative_identity,a,b),
file('/export/starexec/sandbox/tmp/tmp.I2cMXRXqiV/E---3.1_14764.p',not_product_4) ).
cnf(c_0_11,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
associativity_addition_1 ).
cnf(c_0_12,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_13,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_14,hypothesis,
sum(additive_identity,a,b),
sum_3 ).
cnf(c_0_15,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_17,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_18,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
associativity_addition_2 ).
cnf(c_0_19,hypothesis,
sum(a,additive_identity,b),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( sum(additive_identity,X1,X2)
| ~ defined(X2)
| ~ sum(additive_identity,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_16])]) ).
cnf(c_0_21,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_22,axiom,
( product(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ product(X4,X2,X6)
| ~ product(X5,X2,X7)
| ~ sum(X6,X7,X3) ),
distributivity_2 ).
cnf(c_0_23,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_24,plain,
product(multiplicative_identity,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_25,hypothesis,
( sum(X1,additive_identity,X2)
| ~ sum(X3,b,X2)
| ~ sum(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,hypothesis,
sum(additive_identity,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_21])]) ).
cnf(c_0_27,hypothesis,
( product(X1,X2,b)
| ~ product(X3,X2,additive_identity)
| ~ product(X4,X2,a)
| ~ sum(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_28,plain,
product(additive_identity,multiplicative_identity,additive_identity),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
( sum(X1,additive_identity,a)
| ~ sum(additive_identity,a,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
product(multiplicative_identity,a,a),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_31,hypothesis,
( product(X1,multiplicative_identity,b)
| ~ product(X2,multiplicative_identity,a)
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,hypothesis,
sum(a,additive_identity,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_21])]) ).
cnf(c_0_33,hypothesis,
product(a,multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_34,hypothesis,
product(a,multiplicative_identity,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_35,negated_conjecture,
~ product(multiplicative_identity,a,b),
not_product_4 ).
cnf(c_0_36,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : FLD001-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n023.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 23:22:37 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.15/0.39 Running first-order model finding
% 0.15/0.39 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.I2cMXRXqiV/E---3.1_14764.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 14843 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 14847 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 30
% 0.15/0.41 # Removed by relevancy pruning/SinE : 13
% 0.15/0.41 # Initial clauses : 17
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 17
% 0.15/0.41 # Processed clauses : 172
% 0.15/0.41 # ...of these trivial : 2
% 0.15/0.41 # ...subsumed : 39
% 0.15/0.41 # ...remaining for further processing : 131
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 368
% 0.15/0.41 # ...of the previous two non-redundant : 256
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 368
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 144
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 114
% 0.15/0.41 # Positive orientable unit clauses : 21
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 2
% 0.15/0.41 # Non-unit-clauses : 91
% 0.15/0.41 # Current number of unprocessed clauses: 118
% 0.15/0.41 # ...number of literals in the above : 434
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 17
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 691
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 681
% 0.15/0.41 # Non-unit clause-clause subsumptions : 39
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 9
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 5004
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.007 s
% 0.15/0.41 # System time : 0.003 s
% 0.15/0.41 # Total time : 0.011 s
% 0.15/0.41 # Maximum resident set size: 1628 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.008 s
% 0.15/0.41 # System time : 0.006 s
% 0.15/0.41 # Total time : 0.014 s
% 0.15/0.41 # Maximum resident set size: 1696 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------