TSTP Solution File: SEU212+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU212+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:30:49 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 101 ( 23 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 124 ( 46 ~; 45 |; 17 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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; 4 con; 0-2 aty)
% Number of variables : 35 ( 1 sgn 21 !; 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.6YWkdbG5ke/E---3.1_3816.p',d4_funct_1) ).
fof(t8_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( in(X1,relation_dom(X3))
& X2 = apply(X3,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6YWkdbG5ke/E---3.1_3816.p',t8_funct_1) ).
fof(t20_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6YWkdbG5ke/E---3.1_3816.p',t20_relat_1) ).
fof(c_0_3,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_4,plain,
! [X10,X11,X12] :
( ( X12 != apply(X10,X11)
| in(ordered_pair(X11,X12),X10)
| ~ in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) )
& ( ~ in(ordered_pair(X11,X12),X10)
| X12 = apply(X10,X11)
| ~ in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) )
& ( X12 != apply(X10,X11)
| X12 = empty_set
| in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) )
& ( X12 != empty_set
| X12 = apply(X10,X11)
| in(X11,relation_dom(X10))
| ~ relation(X10)
| ~ function(X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( in(X1,relation_dom(X3))
& X2 = apply(X3,X1) ) ) ),
inference(assume_negation,[status(cth)],[t8_funct_1]) ).
cnf(c_0_6,plain,
( in(ordered_pair(X3,X1),X2)
| X1 != apply(X2,X3)
| ~ in(X3,relation_dom(X2))
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
( relation(esk3_0)
& function(esk3_0)
& ( ~ in(ordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk1_0,relation_dom(esk3_0))
| esk2_0 != apply(esk3_0,esk1_0) )
& ( in(esk1_0,relation_dom(esk3_0))
| in(ordered_pair(esk1_0,esk2_0),esk3_0) )
& ( esk2_0 = apply(esk3_0,esk1_0)
| in(ordered_pair(esk1_0,esk2_0),esk3_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,lemma,
! [X36,X37,X38] :
( ( in(X36,relation_dom(X38))
| ~ in(ordered_pair(X36,X37),X38)
| ~ relation(X38) )
& ( in(X37,relation_rng(X38))
| ~ in(ordered_pair(X36,X37),X38)
| ~ relation(X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])])]) ).
cnf(c_0_9,plain,
( in(ordered_pair(X1,apply(X2,X1)),X2)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( esk2_0 = apply(esk3_0,esk1_0)
| in(ordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( in(esk1_0,relation_dom(esk3_0))
| in(ordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( X2 = apply(X3,X1)
| ~ in(ordered_pair(X1,X2),X3)
| ~ in(X1,relation_dom(X3))
| ~ relation(X3)
| ~ function(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,lemma,
( in(X1,relation_dom(X2))
| ~ in(ordered_pair(X1,X3),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(ordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk1_0,relation_dom(esk3_0))
| esk2_0 != apply(esk3_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
in(ordered_pair(esk1_0,esk2_0),esk3_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),c_0_13]) ).
cnf(c_0_18,plain,
( X1 = apply(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ in(ordered_pair(X3,X1),X2) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( apply(esk3_0,esk1_0) != esk2_0
| ~ in(esk1_0,relation_dom(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
apply(esk3_0,esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_11]),c_0_12])]) ).
cnf(c_0_21,negated_conjecture,
~ in(esk1_0,relation_dom(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_22,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_11])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU212+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 08:19:06 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.6YWkdbG5ke/E---3.1_3816.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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 3894 completed with status 0
% 0.20/0.53 # Result found by new_bool_3
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.53 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3897 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.53 # Preprocessing time : 0.004 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 : 215
% 0.20/0.53 # Removed by relevancy pruning/SinE : 162
% 0.20/0.53 # Initial clauses : 101
% 0.20/0.53 # Removed in clause preprocessing : 2
% 0.20/0.53 # Initial clauses in saturation : 99
% 0.20/0.53 # Processed clauses : 400
% 0.20/0.53 # ...of these trivial : 3
% 0.20/0.53 # ...subsumed : 100
% 0.20/0.53 # ...remaining for further processing : 296
% 0.20/0.53 # Other redundant clauses eliminated : 12
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 1
% 0.20/0.53 # Backward-rewritten : 44
% 0.20/0.53 # Generated clauses : 521
% 0.20/0.53 # ...of the previous two non-redundant : 448
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 7
% 0.20/0.53 # Paramodulations : 507
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 14
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 264
% 0.20/0.53 # ...of those cached : 235
% 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 : 149
% 0.20/0.53 # Positive orientable unit clauses : 31
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 18
% 0.20/0.53 # Non-unit-clauses : 100
% 0.20/0.53 # Current number of unprocessed clauses: 225
% 0.20/0.53 # ...number of literals in the above : 681
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 135
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 1960
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 1534
% 0.20/0.53 # Non-unit clause-clause subsumptions : 53
% 0.20/0.53 # Unit Clause-clause subsumption calls : 317
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 12
% 0.20/0.53 # BW rewrite match successes : 8
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 14242
% 0.20/0.53 # Search garbage collected termcells : 2652
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.026 s
% 0.20/0.53 # System time : 0.004 s
% 0.20/0.53 # Total time : 0.030 s
% 0.20/0.53 # Maximum resident set size: 2132 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.031 s
% 0.20/0.53 # System time : 0.007 s
% 0.20/0.53 # Total time : 0.037 s
% 0.20/0.53 # Maximum resident set size: 1908 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------