TSTP Solution File: SEU215+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU215+1 : TPTP v8.1.2. Released v3.3.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 19:25:17 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 171 ( 29 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 222 ( 84 ~; 85 |; 29 &)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn; 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4CFHbNUDRu/E---3.1_27115.p',t23_funct_1) ).
fof(d4_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4CFHbNUDRu/E---3.1_27115.p',d4_funct_1) ).
fof(t21_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(relation_composition(X3,X2)))
<=> ( in(X1,relation_dom(X3))
& in(apply(X3,X1),relation_dom(X2)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4CFHbNUDRu/E---3.1_27115.p',t21_funct_1) ).
fof(t22_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(relation_composition(X3,X2)))
=> apply(relation_composition(X3,X2),X1) = apply(X2,apply(X3,X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4CFHbNUDRu/E---3.1_27115.p',t22_funct_1) ).
fof(fc1_funct_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1)
& relation(X2)
& function(X2) )
=> ( relation(relation_composition(X1,X2))
& function(relation_composition(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4CFHbNUDRu/E---3.1_27115.p',fc1_funct_1) ).
fof(dt_k5_relat_1,axiom,
! [X1,X2] :
( ( relation(X1)
& relation(X2) )
=> relation(relation_composition(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4CFHbNUDRu/E---3.1_27115.p',dt_k5_relat_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
inference(assume_negation,[status(cth)],[t23_funct_1]) ).
fof(c_0_7,plain,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
inference(fof_simplification,[status(thm)],[d4_funct_1]) ).
fof(c_0_8,plain,
! [X10,X11,X12] :
( ( in(X10,relation_dom(X12))
| ~ in(X10,relation_dom(relation_composition(X12,X11)))
| ~ relation(X12)
| ~ function(X12)
| ~ relation(X11)
| ~ function(X11) )
& ( in(apply(X12,X10),relation_dom(X11))
| ~ in(X10,relation_dom(relation_composition(X12,X11)))
| ~ relation(X12)
| ~ function(X12)
| ~ relation(X11)
| ~ function(X11) )
& ( ~ in(X10,relation_dom(X12))
| ~ in(apply(X12,X10),relation_dom(X11))
| in(X10,relation_dom(relation_composition(X12,X11)))
| ~ relation(X12)
| ~ function(X12)
| ~ relation(X11)
| ~ function(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_funct_1])])])]) ).
fof(c_0_9,negated_conjecture,
( relation(esk2_0)
& function(esk2_0)
& relation(esk3_0)
& function(esk3_0)
& in(esk1_0,relation_dom(esk2_0))
& apply(relation_composition(esk2_0,esk3_0),esk1_0) != apply(esk3_0,apply(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X7,X8,X9] :
( ( X9 != apply(X7,X8)
| in(ordered_pair(X8,X9),X7)
| ~ in(X8,relation_dom(X7))
| ~ relation(X7)
| ~ function(X7) )
& ( ~ in(ordered_pair(X8,X9),X7)
| X9 = apply(X7,X8)
| ~ in(X8,relation_dom(X7))
| ~ relation(X7)
| ~ function(X7) )
& ( X9 != apply(X7,X8)
| X9 = empty_set
| in(X8,relation_dom(X7))
| ~ relation(X7)
| ~ function(X7) )
& ( X9 != empty_set
| X9 = apply(X7,X8)
| in(X8,relation_dom(X7))
| ~ relation(X7)
| ~ function(X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
( in(X1,relation_dom(relation_composition(X2,X3)))
| ~ in(X1,relation_dom(X2))
| ~ in(apply(X2,X1),relation_dom(X3))
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X3)
| ~ function(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
in(esk1_0,relation_dom(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( X1 = apply(X2,X3)
| in(X3,relation_dom(X2))
| X1 != empty_set
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X13,X14,X15] :
( ~ relation(X14)
| ~ function(X14)
| ~ relation(X15)
| ~ function(X15)
| ~ in(X13,relation_dom(relation_composition(X15,X14)))
| apply(relation_composition(X15,X14),X13) = apply(X14,apply(X15,X13)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t22_funct_1])])]) ).
cnf(c_0_17,negated_conjecture,
( in(esk1_0,relation_dom(relation_composition(esk2_0,X1)))
| ~ relation(X1)
| ~ function(X1)
| ~ in(apply(esk2_0,esk1_0),relation_dom(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( apply(relation_composition(X2,X1),X3) = apply(X1,apply(X2,X3))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X3,relation_dom(relation_composition(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( apply(X1,apply(esk2_0,esk1_0)) = empty_set
| in(esk1_0,relation_dom(relation_composition(esk2_0,X1)))
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X20,X21] :
( ( relation(relation_composition(X20,X21))
| ~ relation(X20)
| ~ function(X20)
| ~ relation(X21)
| ~ function(X21) )
& ( function(relation_composition(X20,X21))
| ~ relation(X20)
| ~ function(X20)
| ~ relation(X21)
| ~ function(X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_funct_1])])]) ).
fof(c_0_22,plain,
! [X16,X17] :
( ~ relation(X16)
| ~ relation(X17)
| relation(relation_composition(X16,X17)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])]) ).
cnf(c_0_23,negated_conjecture,
apply(relation_composition(esk2_0,esk3_0),esk1_0) != apply(esk3_0,apply(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( apply(X1,apply(esk2_0,esk1_0)) = apply(relation_composition(esk2_0,X1),esk1_0)
| apply(X1,apply(esk2_0,esk1_0)) = empty_set
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13]),c_0_14])]) ).
cnf(c_0_25,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
( function(relation_composition(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
apply(esk3_0,apply(esk2_0,esk1_0)) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_30,plain,
( apply(X1,apply(X2,X3)) = apply(relation_composition(X2,X1),X3)
| apply(relation_composition(X2,X1),X3) = empty_set
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
apply(relation_composition(esk2_0,esk3_0),esk1_0) != empty_set,
inference(rw,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_13]),c_0_25]),c_0_14]),c_0_26])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU215+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 09:18:57 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.4CFHbNUDRu/E---3.1_27115.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # new_bool_3 with pid 27224 completed with status 0
% 0.20/0.53 # Result found by new_bool_3
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 181s (1) cores
% 0.20/0.53 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 27227 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.53 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.20/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 181s (1) cores
% 0.20/0.53 # Preprocessing time : 0.002 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 40
% 0.20/0.53 # Removed by relevancy pruning/SinE : 12
% 0.20/0.53 # Initial clauses : 46
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 46
% 0.20/0.53 # Processed clauses : 600
% 0.20/0.53 # ...of these trivial : 6
% 0.20/0.53 # ...subsumed : 413
% 0.20/0.53 # ...remaining for further processing : 181
% 0.20/0.53 # Other redundant clauses eliminated : 26
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 12
% 0.20/0.53 # Backward-rewritten : 9
% 0.20/0.53 # Generated clauses : 1361
% 0.20/0.53 # ...of the previous two non-redundant : 1275
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 14
% 0.20/0.53 # Paramodulations : 1334
% 0.20/0.53 # Factorizations : 1
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 26
% 0.20/0.53 # Total rewrite steps : 263
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 114
% 0.20/0.53 # Positive orientable unit clauses : 19
% 0.20/0.53 # Positive unorientable unit clauses: 1
% 0.20/0.53 # Negative unit clauses : 13
% 0.20/0.53 # Non-unit-clauses : 81
% 0.20/0.53 # Current number of unprocessed clauses: 751
% 0.20/0.53 # ...number of literals in the above : 4683
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 64
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 3794
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 1423
% 0.20/0.53 # Non-unit clause-clause subsumptions : 211
% 0.20/0.53 # Unit Clause-clause subsumption calls : 78
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 11
% 0.20/0.53 # BW rewrite match successes : 9
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 21520
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.043 s
% 0.20/0.53 # System time : 0.002 s
% 0.20/0.53 # Total time : 0.045 s
% 0.20/0.53 # Maximum resident set size: 1868 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.044 s
% 0.20/0.53 # System time : 0.005 s
% 0.20/0.53 # Total time : 0.049 s
% 0.20/0.53 # Maximum resident set size: 1728 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------