TSTP Solution File: SEU223+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Timeout 0.39s 300.15s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 87 ( 20 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 114 ( 47 ~; 43 |; 14 &)
% ( 1 <=>; 9 =>; 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 : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 32 ( 4 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t70_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.NNN0CVgS6G/E---3.1_22601.p',t70_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.NNN0CVgS6G/E---3.1_22601.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.NNN0CVgS6G/E---3.1_22601.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.NNN0CVgS6G/E---3.1_22601.p',dt_k7_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t70_funct_1]) ).
fof(c_0_5,plain,
! [X46,X47,X48,X49] :
( ( relation_dom(X47) = set_intersection2(relation_dom(X48),X46)
| X47 != relation_dom_restriction(X48,X46)
| ~ relation(X48)
| ~ function(X48)
| ~ relation(X47)
| ~ function(X47) )
& ( ~ in(X49,relation_dom(X47))
| apply(X47,X49) = apply(X48,X49)
| X47 != relation_dom_restriction(X48,X46)
| ~ relation(X48)
| ~ function(X48)
| ~ relation(X47)
| ~ function(X47) )
& ( in(esk13_3(X46,X47,X48),relation_dom(X47))
| relation_dom(X47) != set_intersection2(relation_dom(X48),X46)
| X47 = relation_dom_restriction(X48,X46)
| ~ relation(X48)
| ~ function(X48)
| ~ relation(X47)
| ~ function(X47) )
& ( apply(X47,esk13_3(X46,X47,X48)) != apply(X48,esk13_3(X46,X47,X48))
| relation_dom(X47) != set_intersection2(relation_dom(X48),X46)
| X47 = relation_dom_restriction(X48,X46)
| ~ relation(X48)
| ~ function(X48)
| ~ relation(X47)
| ~ function(X47) ) ),
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_6,negated_conjecture,
( relation(esk12_0)
& function(esk12_0)
& in(esk11_0,relation_dom(relation_dom_restriction(esk12_0,esk10_0)))
& apply(relation_dom_restriction(esk12_0,esk10_0),esk11_0) != apply(esk12_0,esk11_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,negated_conjecture,
in(esk11_0,relation_dom(relation_dom_restriction(esk12_0,esk10_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( apply(relation_dom_restriction(esk12_0,esk10_0),esk11_0) = apply(X1,esk11_0)
| relation_dom_restriction(esk12_0,esk10_0) != relation_dom_restriction(X1,X2)
| ~ function(relation_dom_restriction(esk12_0,esk10_0))
| ~ function(X1)
| ~ relation(relation_dom_restriction(esk12_0,esk10_0))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
function(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
relation(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
apply(relation_dom_restriction(esk12_0,esk10_0),esk11_0) != apply(esk12_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X35,X36] :
( ( relation(relation_dom_restriction(X35,X36))
| ~ relation(X35)
| ~ function(X35) )
& ( function(relation_dom_restriction(X35,X36))
| ~ relation(X35)
| ~ function(X35) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ function(relation_dom_restriction(esk12_0,esk10_0))
| ~ relation(relation_dom_restriction(esk12_0,esk10_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),c_0_11])]),c_0_12]) ).
cnf(c_0_15,plain,
( function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X32,X33] :
( ~ relation(X32)
| relation(relation_dom_restriction(X32,X33)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])]) ).
cnf(c_0_17,negated_conjecture,
~ relation(relation_dom_restriction(esk12_0,esk10_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10]),c_0_11])]) ).
cnf(c_0_18,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU223+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.21/0.36 % WCLimit : 300
% 0.21/0.36 % DateTime : Mon Oct 2 08:28:59 EDT 2023
% 0.21/0.36 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 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.NNN0CVgS6G/E---3.1_22601.p
% 0.39/300.15 # Version: 3.1pre001
% 0.39/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.39/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.39/300.15 # Starting sh5l with 300s (1) cores
% 0.39/300.15 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22678 completed with status 0
% 0.39/300.15 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.39/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/300.15 # No SInE strategy applied
% 0.39/300.15 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.39/300.15 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/300.15 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.39/300.15 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.39/300.15 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/300.15 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.39/300.15 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 22688 completed with status 0
% 0.39/300.15 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.39/300.15 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/300.15 # No SInE strategy applied
% 0.39/300.15 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.39/300.15 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/300.15 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.39/300.15 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.39/300.15 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.39/300.15 # Preprocessing time : 0.002 s
% 0.39/300.15
% 0.39/300.15 # Proof found!
% 0.39/300.15 # SZS status Theorem
% 0.39/300.15 # SZS output start CNFRefutation
% See solution above
% 0.39/300.15 # Parsed axioms : 37
% 0.39/300.15 # Removed by relevancy pruning/SinE : 0
% 0.39/300.15 # Initial clauses : 59
% 0.39/300.15 # Removed in clause preprocessing : 7
% 0.39/300.15 # Initial clauses in saturation : 52
% 0.39/300.15 # Processed clauses : 67
% 0.39/300.15 # ...of these trivial : 3
% 0.39/300.15 # ...subsumed : 3
% 0.39/300.15 # ...remaining for further processing : 61
% 0.39/300.15 # Other redundant clauses eliminated : 0
% 0.39/300.15 # Clauses deleted for lack of memory : 0
% 0.39/300.15 # Backward-subsumed : 2
% 0.39/300.15 # Backward-rewritten : 5
% 0.39/300.15 # Generated clauses : 47
% 0.39/300.15 # ...of the previous two non-redundant : 38
% 0.39/300.15 # ...aggressively subsumed : 0
% 0.39/300.15 # Contextual simplify-reflections : 2
% 0.39/300.15 # Paramodulations : 44
% 0.39/300.15 # Factorizations : 0
% 0.39/300.15 # NegExts : 0
% 0.39/300.15 # Equation resolutions : 3
% 0.39/300.15 # Total rewrite steps : 24
% 0.39/300.15 # Propositional unsat checks : 0
% 0.39/300.15 # Propositional check models : 0
% 0.39/300.15 # Propositional check unsatisfiable : 0
% 0.39/300.15 # Propositional clauses : 0
% 0.39/300.15 # Propositional clauses after purity: 0
% 0.39/300.15 # Propositional unsat core size : 0
% 0.39/300.15 # Propositional preprocessing time : 0.000
% 0.39/300.15 # Propositional encoding time : 0.000
% 0.39/300.15 # Propositional solver time : 0.000
% 0.39/300.15 # Success case prop preproc time : 0.000
% 0.39/300.15 # Success case prop encoding time : 0.000
% 0.39/300.15 # Success case prop solver time : 0.000
% 0.39/300.15 # Current number of processed clauses : 54
% 0.39/300.15 # Positive orientable unit clauses : 22
% 0.39/300.15 # Positive unorientable unit clauses: 1
% 0.39/300.15 # Negative unit clauses : 7
% 0.39/300.15 # Non-unit-clauses : 24
% 0.39/300.15 # Current number of unprocessed clauses: 23
% 0.39/300.15 # ...number of literals in the above : 84
% 0.39/300.15 # Current number of archived formulas : 0
% 0.39/300.15 # Current number of archived clauses : 7
% 0.39/300.15 # Clause-clause subsumption calls (NU) : 174
% 0.39/300.15 # Rec. Clause-clause subsumption calls : 46
% 0.39/300.15 # Non-unit clause-clause subsumptions : 6
% 0.39/300.15 # Unit Clause-clause subsumption calls : 33
% 0.39/300.15 # Rewrite failures with RHS unbound : 0
% 0.39/300.15 # BW rewrite match attempts : 10
% 0.39/300.15 # BW rewrite match successes : 8
% 0.39/300.15 # Condensation attempts : 0
% 0.39/300.15 # Condensation successes : 0
% 0.39/300.15 # Termbank termtop insertions : 2740
% 0.39/300.15
% 0.39/300.15 # -------------------------------------------------
% 0.39/300.15 # User time : 0.008 s
% 0.39/300.15 # System time : 0.003 s
% 0.39/300.15 # Total time : 0.011 s
% 0.39/300.15 # Maximum resident set size: 1812 pages
% 0.39/300.15
% 0.39/300.15 # -------------------------------------------------
% 0.39/300.15 # User time : 0.022 s
% 0.39/300.15 # System time : 0.006 s
% 0.39/300.15 # Total time : 0.028 s
% 0.39/300.15 # Maximum resident set size: 1700 pages
% 0.39/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------