TSTP Solution File: FLD013-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD013-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:29:55 EDT 2023
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 16 unt; 0 nHn; 26 RR)
% Number of literals : 44 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',commutativity_addition) ).
cnf(sum_8,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',sum_8) ).
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.KirdFd2n0q/E---3.1_13872.p',associativity_addition_1) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',existence_of_identity_addition) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',well_definedness_of_additive_identity) ).
cnf(sum_6,negated_conjecture,
sum(additive_identity,a,b),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',sum_6) ).
cnf(sum_7,negated_conjecture,
sum(additive_identity,c,d),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',sum_7) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',c_is_defined) ).
cnf(not_sum_9,negated_conjecture,
~ sum(d,b,u),
file('/export/starexec/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p',not_sum_9) ).
cnf(c_0_9,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_10,negated_conjecture,
sum(a,c,u),
sum_8 ).
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,negated_conjecture,
sum(c,a,u),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,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_15,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_16,negated_conjecture,
( sum(X1,X2,u)
| ~ sum(X3,a,X2)
| ~ sum(X1,X3,c) ),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
sum(additive_identity,a,b),
sum_6 ).
cnf(c_0_18,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_14,c_0_12]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
sum(additive_identity,c,d),
sum_7 ).
cnf(c_0_20,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_21,negated_conjecture,
~ sum(d,b,u),
not_sum_9 ).
cnf(c_0_22,negated_conjecture,
( sum(X1,b,u)
| ~ sum(X1,additive_identity,c) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
sum(additive_identity,d,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
~ sum(d,additive_identity,c),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : FLD013-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n029.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 23:28:22 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.KirdFd2n0q/E---3.1_13872.p
% 0.23/0.53 # Version: 3.1pre001
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # new_bool_1 with pid 13952 completed with status 0
% 0.23/0.53 # Result found by new_bool_1
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # SAT001_MinMin_p005000_rr_RG with pid 13954 completed with status 0
% 0.23/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 35
% 0.23/0.53 # Removed by relevancy pruning/SinE : 21
% 0.23/0.53 # Initial clauses : 14
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 14
% 0.23/0.53 # Processed clauses : 78
% 0.23/0.53 # ...of these trivial : 1
% 0.23/0.53 # ...subsumed : 2
% 0.23/0.53 # ...remaining for further processing : 75
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 0
% 0.23/0.53 # Generated clauses : 153
% 0.23/0.53 # ...of the previous two non-redundant : 125
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 153
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Total rewrite steps : 59
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 61
% 0.23/0.53 # Positive orientable unit clauses : 22
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 2
% 0.23/0.53 # Non-unit-clauses : 37
% 0.23/0.53 # Current number of unprocessed clauses: 75
% 0.23/0.53 # ...number of literals in the above : 241
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 14
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 149
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 149
% 0.23/0.53 # Non-unit clause-clause subsumptions : 2
% 0.23/0.53 # Unit Clause-clause subsumption calls : 5
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 2
% 0.23/0.53 # BW rewrite match successes : 0
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 2226
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.005 s
% 0.23/0.53 # System time : 0.002 s
% 0.23/0.53 # Total time : 0.007 s
% 0.23/0.53 # Maximum resident set size: 1636 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.006 s
% 0.23/0.53 # System time : 0.004 s
% 0.23/0.53 # Total time : 0.011 s
% 0.23/0.53 # Maximum resident set size: 1704 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------