TSTP Solution File: SEU225+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU225+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:21 EDT 2023
% Result : Theorem 0.16s 0.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 176 ( 42 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 230 ( 90 ~; 93 |; 25 &)
% ( 6 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 73 ( 5 sgn; 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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.2Bnmgxu7dc/E---3.1_15687.p',d4_funct_1) ).
fof(t68_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( X2 = relation_dom_restriction(X3,X1)
<=> ( relation_dom(X2) = set_intersection2(relation_dom(X3),X1)
& ! [X4] :
( in(X4,relation_dom(X2))
=> apply(X2,X4) = apply(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2Bnmgxu7dc/E---3.1_15687.p',t68_funct_1) ).
fof(fc4_funct_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1) )
=> ( relation(relation_dom_restriction(X1,X2))
& function(relation_dom_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2Bnmgxu7dc/E---3.1_15687.p',fc4_funct_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.2Bnmgxu7dc/E---3.1_15687.p',dt_k7_relat_1) ).
fof(t72_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,X1)
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2Bnmgxu7dc/E---3.1_15687.p',t72_funct_1) ).
fof(l82_funct_1,axiom,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
<=> ( in(X2,relation_dom(X3))
& in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2Bnmgxu7dc/E---3.1_15687.p',l82_funct_1) ).
fof(c_0_6,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_7,plain,
! [X67,X68,X69,X70] :
( ( relation_dom(X68) = set_intersection2(relation_dom(X69),X67)
| X68 != relation_dom_restriction(X69,X67)
| ~ relation(X69)
| ~ function(X69)
| ~ relation(X68)
| ~ function(X68) )
& ( ~ in(X70,relation_dom(X68))
| apply(X68,X70) = apply(X69,X70)
| X68 != relation_dom_restriction(X69,X67)
| ~ relation(X69)
| ~ function(X69)
| ~ relation(X68)
| ~ function(X68) )
& ( in(esk12_3(X67,X68,X69),relation_dom(X68))
| relation_dom(X68) != set_intersection2(relation_dom(X69),X67)
| X68 = relation_dom_restriction(X69,X67)
| ~ relation(X69)
| ~ function(X69)
| ~ relation(X68)
| ~ function(X68) )
& ( apply(X68,esk12_3(X67,X68,X69)) != apply(X69,esk12_3(X67,X68,X69))
| relation_dom(X68) != set_intersection2(relation_dom(X69),X67)
| X68 = relation_dom_restriction(X69,X67)
| ~ relation(X69)
| ~ function(X69)
| ~ relation(X68)
| ~ function(X68) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t68_funct_1])])])])]) ).
fof(c_0_8,plain,
! [X33,X34] :
( ( relation(relation_dom_restriction(X33,X34))
| ~ relation(X33)
| ~ function(X33) )
& ( function(relation_dom_restriction(X33,X34))
| ~ relation(X33)
| ~ function(X33) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])]) ).
fof(c_0_9,plain,
! [X19,X20] :
( ~ relation(X19)
| relation(relation_dom_restriction(X19,X20)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])]) ).
fof(c_0_10,plain,
! [X14,X15,X16] :
( ( X16 != apply(X14,X15)
| in(ordered_pair(X15,X16),X14)
| ~ in(X15,relation_dom(X14))
| ~ relation(X14)
| ~ function(X14) )
& ( ~ in(ordered_pair(X15,X16),X14)
| X16 = apply(X14,X15)
| ~ in(X15,relation_dom(X14))
| ~ relation(X14)
| ~ function(X14) )
& ( X16 != apply(X14,X15)
| X16 = empty_set
| in(X15,relation_dom(X14))
| ~ relation(X14)
| ~ function(X14) )
& ( X16 != empty_set
| X16 = apply(X14,X15)
| in(X15,relation_dom(X14))
| ~ relation(X14)
| ~ function(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,X1)
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t72_funct_1]) ).
cnf(c_0_12,plain,
( apply(X2,X1) = apply(X3,X1)
| ~ in(X1,relation_dom(X2))
| X2 != relation_dom_restriction(X3,X4)
| ~ relation(X3)
| ~ function(X3)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X38,X39,X40] :
( ( in(X39,relation_dom(X40))
| ~ in(X39,relation_dom(relation_dom_restriction(X40,X38)))
| ~ relation(X40)
| ~ function(X40) )
& ( in(X39,X38)
| ~ in(X39,relation_dom(relation_dom_restriction(X40,X38)))
| ~ relation(X40)
| ~ function(X40) )
& ( ~ in(X39,relation_dom(X40))
| ~ in(X39,X38)
| in(X39,relation_dom(relation_dom_restriction(X40,X38)))
| ~ relation(X40)
| ~ function(X40) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l82_funct_1])])]) ).
cnf(c_0_16,plain,
( X1 = empty_set
| in(X3,relation_dom(X2))
| X1 != apply(X2,X3)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
( relation(esk15_0)
& function(esk15_0)
& in(esk14_0,esk13_0)
& apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_18,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ in(X1,relation_dom(X2))
| ~ in(X1,X3)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(X1))
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
function(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
in(esk14_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( apply(relation_dom_restriction(X1,X2),X3) = empty_set
| in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(relation_dom_restriction(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_27,negated_conjecture,
~ in(esk14_0,relation_dom(esk15_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
( apply(esk15_0,X1) = empty_set
| in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
( apply(relation_dom_restriction(X1,X2),X3) = empty_set
| in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_30,negated_conjecture,
apply(esk15_0,esk14_0) = empty_set,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( in(X1,relation_dom(X2))
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( apply(relation_dom_restriction(esk15_0,X1),X2) = empty_set
| in(X2,relation_dom(relation_dom_restriction(esk15_0,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_24])]) ).
cnf(c_0_33,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != empty_set,
inference(rw,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( apply(relation_dom_restriction(esk15_0,X1),X2) = empty_set
| in(X2,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]),c_0_24])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU225+3 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 09:06:35 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.2Bnmgxu7dc/E---3.1_15687.p
% 0.16/0.51 # Version: 3.1pre001
% 0.16/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 # Starting sh5l with 300s (1) cores
% 0.16/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15765 completed with status 0
% 0.16/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.51 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.51 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.51 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.16/0.51 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.51 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.16/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15772 completed with status 0
% 0.16/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.51 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.51 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.51 # Preprocessing time : 0.001 s
% 0.16/0.51 # Presaturation interreduction done
% 0.16/0.51
% 0.16/0.51 # Proof found!
% 0.16/0.51 # SZS status Theorem
% 0.16/0.51 # SZS output start CNFRefutation
% See solution above
% 0.16/0.51 # Parsed axioms : 46
% 0.16/0.51 # Removed by relevancy pruning/SinE : 0
% 0.16/0.51 # Initial clauses : 76
% 0.16/0.51 # Removed in clause preprocessing : 3
% 0.16/0.51 # Initial clauses in saturation : 73
% 0.16/0.51 # Processed clauses : 1134
% 0.16/0.51 # ...of these trivial : 5
% 0.16/0.51 # ...subsumed : 722
% 0.16/0.51 # ...remaining for further processing : 407
% 0.16/0.51 # Other redundant clauses eliminated : 5
% 0.16/0.51 # Clauses deleted for lack of memory : 0
% 0.16/0.51 # Backward-subsumed : 31
% 0.16/0.51 # Backward-rewritten : 22
% 0.16/0.51 # Generated clauses : 2879
% 0.16/0.51 # ...of the previous two non-redundant : 2318
% 0.16/0.51 # ...aggressively subsumed : 0
% 0.16/0.51 # Contextual simplify-reflections : 40
% 0.16/0.51 # Paramodulations : 2872
% 0.16/0.51 # Factorizations : 0
% 0.16/0.51 # NegExts : 0
% 0.16/0.51 # Equation resolutions : 7
% 0.16/0.51 # Total rewrite steps : 2908
% 0.16/0.51 # Propositional unsat checks : 0
% 0.16/0.51 # Propositional check models : 0
% 0.16/0.51 # Propositional check unsatisfiable : 0
% 0.16/0.51 # Propositional clauses : 0
% 0.16/0.51 # Propositional clauses after purity: 0
% 0.16/0.51 # Propositional unsat core size : 0
% 0.16/0.51 # Propositional preprocessing time : 0.000
% 0.16/0.51 # Propositional encoding time : 0.000
% 0.16/0.51 # Propositional solver time : 0.000
% 0.16/0.51 # Success case prop preproc time : 0.000
% 0.16/0.51 # Success case prop encoding time : 0.000
% 0.16/0.51 # Success case prop solver time : 0.000
% 0.16/0.51 # Current number of processed clauses : 283
% 0.16/0.51 # Positive orientable unit clauses : 45
% 0.16/0.51 # Positive unorientable unit clauses: 2
% 0.16/0.51 # Negative unit clauses : 15
% 0.16/0.51 # Non-unit-clauses : 221
% 0.16/0.51 # Current number of unprocessed clauses: 1245
% 0.16/0.51 # ...number of literals in the above : 6709
% 0.16/0.51 # Current number of archived formulas : 0
% 0.16/0.51 # Current number of archived clauses : 120
% 0.16/0.51 # Clause-clause subsumption calls (NU) : 15747
% 0.16/0.51 # Rec. Clause-clause subsumption calls : 6551
% 0.16/0.51 # Non-unit clause-clause subsumptions : 543
% 0.16/0.51 # Unit Clause-clause subsumption calls : 518
% 0.16/0.51 # Rewrite failures with RHS unbound : 0
% 0.16/0.51 # BW rewrite match attempts : 32
% 0.16/0.51 # BW rewrite match successes : 30
% 0.16/0.51 # Condensation attempts : 0
% 0.16/0.51 # Condensation successes : 0
% 0.16/0.51 # Termbank termtop insertions : 51376
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.068 s
% 0.16/0.51 # System time : 0.004 s
% 0.16/0.51 # Total time : 0.072 s
% 0.16/0.51 # Maximum resident set size: 1896 pages
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.325 s
% 0.16/0.51 # System time : 0.025 s
% 0.16/0.51 # Total time : 0.350 s
% 0.16/0.51 # Maximum resident set size: 1732 pages
% 0.16/0.51 % E---3.1 exiting
% 0.16/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------