TSTP Solution File: SEU225+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU225+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:31:00 EDT 2023
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 170 ( 36 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 229 ( 93 ~; 89 |; 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 : 59 ( 4 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/sandbox/tmp/tmp.hTYg9ys6kI/E---3.1_11736.p',d4_funct_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/sandbox/tmp/tmp.hTYg9ys6kI/E---3.1_11736.p',t72_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/sandbox/tmp/tmp.hTYg9ys6kI/E---3.1_11736.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/sandbox/tmp/tmp.hTYg9ys6kI/E---3.1_11736.p',fc4_funct_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.hTYg9ys6kI/E---3.1_11736.p',dt_k7_relat_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/sandbox/tmp/tmp.hTYg9ys6kI/E---3.1_11736.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,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]) ).
fof(c_0_8,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_9,plain,
! [X53,X54,X55,X56] :
( ( relation_dom(X54) = set_intersection2(relation_dom(X55),X53)
| X54 != relation_dom_restriction(X55,X53)
| ~ relation(X55)
| ~ function(X55)
| ~ relation(X54)
| ~ function(X54) )
& ( ~ in(X56,relation_dom(X54))
| apply(X54,X56) = apply(X55,X56)
| X54 != relation_dom_restriction(X55,X53)
| ~ relation(X55)
| ~ function(X55)
| ~ relation(X54)
| ~ function(X54) )
& ( in(esk10_3(X53,X54,X55),relation_dom(X54))
| relation_dom(X54) != set_intersection2(relation_dom(X55),X53)
| X54 = relation_dom_restriction(X55,X53)
| ~ relation(X55)
| ~ function(X55)
| ~ relation(X54)
| ~ function(X54) )
& ( apply(X54,esk10_3(X53,X54,X55)) != apply(X55,esk10_3(X53,X54,X55))
| relation_dom(X54) != set_intersection2(relation_dom(X55),X53)
| X54 = relation_dom_restriction(X55,X53)
| ~ relation(X55)
| ~ function(X55)
| ~ relation(X54)
| ~ function(X54) ) ),
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_10,plain,
! [X32,X33] :
( ( relation(relation_dom_restriction(X32,X33))
| ~ relation(X32)
| ~ function(X32) )
& ( function(relation_dom_restriction(X32,X33))
| ~ relation(X32)
| ~ function(X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])]) ).
fof(c_0_11,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_12,negated_conjecture,
( relation(esk13_0)
& function(esk13_0)
& in(esk12_0,esk11_0)
& apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0) != apply(esk13_0,esk12_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_13,plain,
( X1 = empty_set
| in(X3,relation_dom(X2))
| X1 != apply(X2,X3)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,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_9]) ).
cnf(c_0_15,plain,
( function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X37,X38,X39] :
( ( in(X38,relation_dom(X39))
| ~ in(X38,relation_dom(relation_dom_restriction(X39,X37)))
| ~ relation(X39)
| ~ function(X39) )
& ( in(X38,X37)
| ~ in(X38,relation_dom(relation_dom_restriction(X39,X37)))
| ~ relation(X39)
| ~ function(X39) )
& ( ~ in(X38,relation_dom(X39))
| ~ in(X38,X37)
| in(X38,relation_dom(relation_dom_restriction(X39,X37)))
| ~ relation(X39)
| ~ function(X39) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l82_funct_1])])]) ).
cnf(c_0_18,negated_conjecture,
apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0) != apply(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_20,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_14]),c_0_15]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
relation(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
function(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,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_17]) ).
cnf(c_0_24,negated_conjecture,
( in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0)))
| apply(esk13_0,esk12_0) != empty_set
| ~ relation(relation_dom_restriction(esk13_0,esk11_0))
| ~ function(relation_dom_restriction(esk13_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ in(esk12_0,relation_dom(relation_dom_restriction(esk13_0,esk11_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_26,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_17]) ).
cnf(c_0_27,negated_conjecture,
in(esk12_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( in(esk12_0,relation_dom(esk13_0))
| apply(esk13_0,esk12_0) != empty_set
| ~ relation(relation_dom_restriction(esk13_0,esk11_0))
| ~ function(relation_dom_restriction(esk13_0,esk11_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
~ in(esk12_0,relation_dom(esk13_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21]),c_0_22]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
( in(esk12_0,relation_dom(esk13_0))
| ~ relation(relation_dom_restriction(esk13_0,esk11_0))
| ~ function(relation_dom_restriction(esk13_0,esk11_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_21]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
( ~ relation(relation_dom_restriction(esk13_0,esk11_0))
| ~ function(relation_dom_restriction(esk13_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
~ relation(relation_dom_restriction(esk13_0,esk11_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_21]),c_0_22])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : SEU225+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n024.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 09:11:27 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.hTYg9ys6kI/E---3.1_11736.p
% 0.14/0.43 # Version: 3.1pre001
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11863 completed with status 0
% 0.14/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.43 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.14/0.43 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 11872 completed with status 0
% 0.14/0.43 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.43 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.43 # Preprocessing time : 0.002 s
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Theorem
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 47
% 0.14/0.43 # Removed by relevancy pruning/SinE : 0
% 0.14/0.43 # Initial clauses : 74
% 0.14/0.43 # Removed in clause preprocessing : 11
% 0.14/0.43 # Initial clauses in saturation : 63
% 0.14/0.43 # Processed clauses : 142
% 0.14/0.43 # ...of these trivial : 7
% 0.14/0.43 # ...subsumed : 23
% 0.14/0.43 # ...remaining for further processing : 112
% 0.14/0.43 # Other redundant clauses eliminated : 0
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 17
% 0.14/0.43 # Backward-rewritten : 11
% 0.14/0.43 # Generated clauses : 254
% 0.14/0.43 # ...of the previous two non-redundant : 222
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 11
% 0.14/0.43 # Paramodulations : 245
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 9
% 0.14/0.43 # Total rewrite steps : 116
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 84
% 0.14/0.43 # Positive orientable unit clauses : 23
% 0.14/0.43 # Positive unorientable unit clauses: 2
% 0.14/0.43 # Negative unit clauses : 14
% 0.14/0.43 # Non-unit-clauses : 45
% 0.14/0.43 # Current number of unprocessed clauses: 135
% 0.14/0.43 # ...number of literals in the above : 708
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 29
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 576
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 258
% 0.14/0.43 # Non-unit clause-clause subsumptions : 33
% 0.14/0.43 # Unit Clause-clause subsumption calls : 116
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 19
% 0.14/0.43 # BW rewrite match successes : 17
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 6196
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.011 s
% 0.14/0.43 # System time : 0.006 s
% 0.14/0.43 # Total time : 0.017 s
% 0.14/0.43 # Maximum resident set size: 1868 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.055 s
% 0.14/0.43 # System time : 0.016 s
% 0.14/0.43 # Total time : 0.071 s
% 0.14/0.43 # Maximum resident set size: 1712 pages
% 0.14/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------