TSTP Solution File: SEU391+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU391+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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 : 600s
% DateTime : Tue Jul 19 09:19:37 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 145 ( 8 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 185 ( 69 ~; 84 |; 22 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 17 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fraenkel_a_2_1_yellow19,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X2)
& one_sorted_str(X2)
& ~ empty_carrier(X3)
& net_str(X3,X2) )
=> ( in(X1,a_2_1_yellow19(X2,X3))
<=> ? [X4] :
( element(X4,powerset(the_carrier(X2)))
& X1 = X4
& is_eventually_in(X2,X3,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fraenkel_a_2_1_yellow19) ).
fof(t11_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( is_eventually_in(X1,X2,X3)
& element(X3,powerset(the_carrier(X1))) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t11_yellow19) ).
fof(d3_yellow19,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_yellow19) ).
fof(c_0_3,plain,
! [X5,X6,X7,X9] :
( ( element(esk8_3(X5,X6,X7),powerset(the_carrier(X6)))
| ~ in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) )
& ( X5 = esk8_3(X5,X6,X7)
| ~ in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) )
& ( is_eventually_in(X6,X7,esk8_3(X5,X6,X7))
| ~ in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) )
& ( ~ element(X9,powerset(the_carrier(X6)))
| X5 != X9
| ~ is_eventually_in(X6,X7,X9)
| in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fraenkel_a_2_1_yellow19])])])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( is_eventually_in(X1,X2,X3)
& element(X3,powerset(the_carrier(X1))) ) ) ) ),
inference(assume_negation,[status(cth)],[t11_yellow19]) ).
cnf(c_0_5,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X1))
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ is_eventually_in(X2,X1,X4)
| X3 != X4
| ~ element(X4,powerset(the_carrier(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(esk2_0)
& net_str(esk2_0,esk1_0)
& ( ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ element(esk3_0,powerset(the_carrier(esk1_0))) )
& ( is_eventually_in(esk1_0,esk2_0,esk3_0)
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) )
& ( element(esk3_0,powerset(the_carrier(esk1_0)))
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])]) ).
cnf(c_0_7,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X1,X2))
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(X3,powerset(the_carrier(X1))) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| is_eventually_in(esk1_0,esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| element(esk3_0,powerset(the_carrier(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty_carrier(X4)
| ~ net_str(X4,X3)
| filter_of_net_str(X3,X4) = a_2_1_yellow19(X3,X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d3_yellow19])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| in(esk3_0,a_2_1_yellow19(esk1_0,esk2_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
( filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ element(esk3_0,powerset(the_carrier(esk1_0)))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
in(esk3_0,filter_of_net_str(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9]),c_0_10])]),c_0_11]),c_0_12]) ).
cnf(c_0_19,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,esk8_3(X3,X2,X1))
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| X3 = esk8_3(X3,X2,X1)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_21,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk8_3(X3,X2,X1),powerset(the_carrier(X2)))
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_22,negated_conjecture,
( ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ element(esk3_0,powerset(the_carrier(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_23,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ in(X3,a_2_1_yellow19(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( element(X1,powerset(the_carrier(X2)))
| empty_carrier(X2)
| empty_carrier(X3)
| ~ net_str(X3,X2)
| ~ one_sorted_str(X2)
| ~ in(X1,a_2_1_yellow19(X2,X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ element(esk3_0,powerset(the_carrier(esk1_0)))
| ~ in(esk3_0,a_2_1_yellow19(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9]),c_0_10])]),c_0_11]),c_0_12]) ).
cnf(c_0_26,plain,
( element(X1,powerset(the_carrier(X2)))
| empty_carrier(X3)
| empty_carrier(X2)
| ~ net_str(X3,X2)
| ~ one_sorted_str(X2)
| ~ in(X1,filter_of_net_str(X2,X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_27,negated_conjecture,
~ element(esk3_0,powerset(the_carrier(esk1_0))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_16]),c_0_18]),c_0_9]),c_0_10])]),c_0_11]),c_0_12]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_9]),c_0_10])]),c_0_27]),c_0_12]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU391+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 01:43:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.020 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 29
% 0.24/1.42 # Proof object clause steps : 22
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 16
% 0.24/1.42 # Proof object clause conjectures : 13
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 12
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 8
% 0.24/1.42 # Proof object simplifying inferences : 31
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 101
% 0.24/1.42 # Removed by relevancy pruning/SinE : 62
% 0.24/1.42 # Initial clauses : 96
% 0.24/1.42 # Removed in clause preprocessing : 2
% 0.24/1.42 # Initial clauses in saturation : 94
% 0.24/1.42 # Processed clauses : 273
% 0.24/1.42 # ...of these trivial : 6
% 0.24/1.42 # ...subsumed : 89
% 0.24/1.42 # ...remaining for further processing : 178
% 0.24/1.42 # Other redundant clauses eliminated : 1
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 5
% 0.24/1.42 # Backward-rewritten : 6
% 0.24/1.42 # Generated clauses : 405
% 0.24/1.42 # ...of the previous two non-trivial : 371
% 0.24/1.42 # Contextual simplify-reflections : 30
% 0.24/1.42 # Paramodulations : 402
% 0.24/1.42 # Factorizations : 2
% 0.24/1.42 # Equation resolutions : 1
% 0.24/1.42 # Current number of processed clauses : 166
% 0.24/1.42 # Positive orientable unit clauses : 54
% 0.24/1.42 # Positive unorientable unit clauses: 1
% 0.24/1.42 # Negative unit clauses : 15
% 0.24/1.42 # Non-unit-clauses : 96
% 0.24/1.42 # Current number of unprocessed clauses: 175
% 0.24/1.42 # ...number of literals in the above : 838
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 11
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 3379
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 1638
% 0.24/1.42 # Non-unit clause-clause subsumptions : 97
% 0.24/1.42 # Unit Clause-clause subsumption calls : 282
% 0.24/1.42 # Rewrite failures with RHS unbound : 12
% 0.24/1.42 # BW rewrite match attempts : 9
% 0.24/1.42 # BW rewrite match successes : 9
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 10938
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.035 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.040 s
% 0.24/1.42 # Maximum resident set size: 3760 pages
%------------------------------------------------------------------------------