TSTP Solution File: SEU317+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU317+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:18:55 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 4 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 133 ( 53 ~; 57 |; 10 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 56 ( 4 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d3_tarski) ).
fof(t45_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( in(X3,the_carrier(X1))
=> ( in(X3,topstr_closure(X1,X2))
<=> ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( ( closed_subset(X4,X1)
& subset(X2,X4) )
=> in(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t45_pre_topc) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t3_subset) ).
fof(t48_pre_topc,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t48_pre_topc) ).
fof(c_0_4,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8] :
( ( ~ in(X7,topstr_closure(X5,X6))
| ~ element(X8,powerset(the_carrier(X5)))
| ~ closed_subset(X8,X5)
| ~ subset(X6,X8)
| in(X7,X8)
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( element(esk8_3(X5,X6,X7),powerset(the_carrier(X5)))
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( closed_subset(esk8_3(X5,X6,X7),X5)
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( subset(X6,esk8_3(X5,X6,X7))
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( ~ in(X7,esk8_3(X5,X6,X7))
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) ) ),
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)],[t45_pre_topc])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
cnf(c_0_7,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(X3,topstr_closure(X1,X2))
| subset(X2,esk8_3(X1,X2,X3))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X3,topstr_closure(X1,X2))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(X3,the_carrier(X1))
| ~ in(X3,esk8_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( in(X1,esk8_3(X2,X3,X4))
| in(X4,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X4,the_carrier(X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[t48_pre_topc]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
fof(c_0_16,negated_conjecture,
( top_str(esk9_0)
& element(esk10_0,powerset(the_carrier(esk9_0)))
& ~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
cnf(c_0_17,plain,
( subset(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(esk1_2(X1,topstr_closure(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( subset(X1,topstr_closure(X2,X1))
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
top_str(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
element(esk10_0,powerset(the_carrier(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU317+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 19:11:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/1.41 # Preprocessing time : 0.018 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 24
% 0.24/1.41 # Proof object clause steps : 15
% 0.24/1.41 # Proof object formula steps : 9
% 0.24/1.41 # Proof object conjectures : 7
% 0.24/1.41 # Proof object clause conjectures : 4
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 9
% 0.24/1.41 # Proof object initial formulas used : 4
% 0.24/1.41 # Proof object generating inferences : 6
% 0.24/1.41 # Proof object simplifying inferences : 4
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 43
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 88
% 0.24/1.41 # Removed in clause preprocessing : 5
% 0.24/1.41 # Initial clauses in saturation : 83
% 0.24/1.41 # Processed clauses : 3301
% 0.24/1.41 # ...of these trivial : 6
% 0.24/1.41 # ...subsumed : 1922
% 0.24/1.41 # ...remaining for further processing : 1373
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 40
% 0.24/1.41 # Backward-rewritten : 8
% 0.24/1.41 # Generated clauses : 8541
% 0.24/1.41 # ...of the previous two non-trivial : 7375
% 0.24/1.41 # Contextual simplify-reflections : 1751
% 0.24/1.41 # Paramodulations : 8541
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 1325
% 0.24/1.41 # Positive orientable unit clauses : 42
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 16
% 0.24/1.41 # Non-unit-clauses : 1267
% 0.24/1.41 # Current number of unprocessed clauses: 3382
% 0.24/1.41 # ...number of literals in the above : 17008
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 48
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 575846
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 304481
% 0.24/1.41 # Non-unit clause-clause subsumptions : 3475
% 0.24/1.41 # Unit Clause-clause subsumption calls : 1748
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 44
% 0.24/1.41 # BW rewrite match successes : 7
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 136336
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.292 s
% 0.24/1.41 # System time : 0.008 s
% 0.24/1.41 # Total time : 0.300 s
% 0.24/1.41 # Maximum resident set size: 8292 pages
% 0.24/23.40 eprover: CPU time limit exceeded, terminating
% 0.24/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.41 eprover: No such file or directory
% 0.24/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42 eprover: No such file or directory
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------