TSTP Solution File: SEU223+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU223+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 82 ( 19 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 106 ( 42 ~; 40 |; 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 : 33 ( 3 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/sandbox2/tmp/tmp.2QsavXiPHk/E---3.1_25537.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/sandbox2/tmp/tmp.2QsavXiPHk/E---3.1_25537.p',t68_funct_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.2QsavXiPHk/E---3.1_25537.p',dt_k7_relat_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.2QsavXiPHk/E---3.1_25537.p',fc4_funct_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,
! [X8,X9,X10,X11] :
( ( relation_dom(X9) = set_intersection2(relation_dom(X10),X8)
| X9 != relation_dom_restriction(X10,X8)
| ~ relation(X10)
| ~ function(X10)
| ~ relation(X9)
| ~ function(X9) )
& ( ~ in(X11,relation_dom(X9))
| apply(X9,X11) = apply(X10,X11)
| X9 != relation_dom_restriction(X10,X8)
| ~ relation(X10)
| ~ function(X10)
| ~ relation(X9)
| ~ function(X9) )
& ( in(esk4_3(X8,X9,X10),relation_dom(X9))
| relation_dom(X9) != set_intersection2(relation_dom(X10),X8)
| X9 = relation_dom_restriction(X10,X8)
| ~ relation(X10)
| ~ function(X10)
| ~ relation(X9)
| ~ function(X9) )
& ( apply(X9,esk4_3(X8,X9,X10)) != apply(X10,esk4_3(X8,X9,X10))
| relation_dom(X9) != set_intersection2(relation_dom(X10),X8)
| X9 = relation_dom_restriction(X10,X8)
| ~ relation(X10)
| ~ function(X10)
| ~ relation(X9)
| ~ function(X9) ) ),
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,plain,
! [X13,X14] :
( ~ relation(X13)
| relation(relation_dom_restriction(X13,X14)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])]) ).
fof(c_0_7,plain,
! [X15,X16] :
( ( relation(relation_dom_restriction(X15,X16))
| ~ relation(X15)
| ~ function(X15) )
& ( function(relation_dom_restriction(X15,X16))
| ~ relation(X15)
| ~ function(X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])]) ).
fof(c_0_8,negated_conjecture,
( relation(esk3_0)
& function(esk3_0)
& in(esk2_0,relation_dom(relation_dom_restriction(esk3_0,esk1_0)))
& apply(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != apply(esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_9,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_10,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != apply(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ function(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
in(esk2_0,relation_dom(relation_dom_restriction(esk3_0,esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU223+3 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n004.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 08:42:30 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.2QsavXiPHk/E---3.1_25537.p
% 0.18/0.46 # Version: 3.1pre001
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # new_bool_3 with pid 25643 completed with status 0
% 0.18/0.46 # Result found by new_bool_3
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.18/0.46 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.18/0.46 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25647 completed with status 0
% 0.18/0.46 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.18/0.46 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 39
% 0.18/0.46 # Removed by relevancy pruning/SinE : 7
% 0.18/0.46 # Initial clauses : 48
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 48
% 0.18/0.46 # Processed clauses : 149
% 0.18/0.46 # ...of these trivial : 2
% 0.18/0.46 # ...subsumed : 23
% 0.18/0.46 # ...remaining for further processing : 124
% 0.18/0.46 # Other redundant clauses eliminated : 2
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 16
% 0.18/0.46 # Generated clauses : 110
% 0.18/0.46 # ...of the previous two non-redundant : 101
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 4
% 0.18/0.46 # Paramodulations : 107
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 3
% 0.18/0.46 # Total rewrite steps : 51
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 60
% 0.18/0.46 # Positive orientable unit clauses : 19
% 0.18/0.46 # Positive unorientable unit clauses: 1
% 0.18/0.46 # Negative unit clauses : 8
% 0.18/0.46 # Non-unit-clauses : 32
% 0.18/0.46 # Current number of unprocessed clauses: 37
% 0.18/0.46 # ...number of literals in the above : 194
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 62
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 260
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 177
% 0.18/0.46 # Non-unit clause-clause subsumptions : 16
% 0.18/0.46 # Unit Clause-clause subsumption calls : 27
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 14
% 0.18/0.46 # BW rewrite match successes : 13
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 3677
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.007 s
% 0.18/0.46 # System time : 0.003 s
% 0.18/0.46 # Total time : 0.010 s
% 0.18/0.46 # Maximum resident set size: 1860 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.009 s
% 0.18/0.46 # System time : 0.004 s
% 0.18/0.46 # Total time : 0.013 s
% 0.18/0.46 # Maximum resident set size: 1704 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------