TSTP Solution File: SET807+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET807+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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 00:54:29 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 46 ( 3 avg)
% Number of connectives : 140 ( 42 ~; 69 |; 21 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 9 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',power_set) ).
fof(rel_subset,hypothesis,
! [X3,X5] :
( apply(subset_predicate,X3,X5)
<=> subset(X3,X5) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rel_subset) ).
fof(pre_order,axiom,
! [X7,X4] :
( pre_order(X7,X4)
<=> ( ! [X3] :
( member(X3,X4)
=> apply(X7,X3,X3) )
& ! [X3,X5,X6] :
( ( member(X3,X4)
& member(X5,X4)
& member(X6,X4) )
=> ( ( apply(X7,X3,X5)
& apply(X7,X5,X6) )
=> apply(X7,X3,X6) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+2.ax',pre_order) ).
fof(thIV18a,conjecture,
! [X4] : pre_order(subset_predicate,power_set(X4)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIV18a) ).
fof(c_0_5,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk2_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk2_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)],[subset])])])])])])]) ).
fof(c_0_6,plain,
! [X4,X5,X4,X5] :
( ( ~ member(X4,power_set(X5))
| subset(X4,X5) )
& ( ~ subset(X4,X5)
| member(X4,power_set(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])])])]) ).
fof(c_0_7,hypothesis,
! [X6,X7,X6,X7] :
( ( ~ apply(subset_predicate,X6,X7)
| subset(X6,X7) )
& ( ~ subset(X6,X7)
| apply(subset_predicate,X6,X7) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rel_subset])])])]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( subset(X1,X2)
| ~ apply(subset_predicate,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X8,X9,X10,X11,X12,X13,X8,X9] :
( ( ~ member(X10,X9)
| apply(X8,X10,X10)
| ~ pre_order(X8,X9) )
& ( ~ member(X11,X9)
| ~ member(X12,X9)
| ~ member(X13,X9)
| ~ apply(X8,X11,X12)
| ~ apply(X8,X12,X13)
| apply(X8,X11,X13)
| ~ pre_order(X8,X9) )
& ( member(esk4_2(X8,X9),X9)
| member(esk3_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( member(esk5_2(X8,X9),X9)
| member(esk3_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( member(esk6_2(X8,X9),X9)
| member(esk3_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( apply(X8,esk4_2(X8,X9),esk5_2(X8,X9))
| member(esk3_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( apply(X8,esk5_2(X8,X9),esk6_2(X8,X9))
| member(esk3_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( ~ apply(X8,esk4_2(X8,X9),esk6_2(X8,X9))
| member(esk3_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( member(esk4_2(X8,X9),X9)
| ~ apply(X8,esk3_2(X8,X9),esk3_2(X8,X9))
| pre_order(X8,X9) )
& ( member(esk5_2(X8,X9),X9)
| ~ apply(X8,esk3_2(X8,X9),esk3_2(X8,X9))
| pre_order(X8,X9) )
& ( member(esk6_2(X8,X9),X9)
| ~ apply(X8,esk3_2(X8,X9),esk3_2(X8,X9))
| pre_order(X8,X9) )
& ( apply(X8,esk4_2(X8,X9),esk5_2(X8,X9))
| ~ apply(X8,esk3_2(X8,X9),esk3_2(X8,X9))
| pre_order(X8,X9) )
& ( apply(X8,esk5_2(X8,X9),esk6_2(X8,X9))
| ~ apply(X8,esk3_2(X8,X9),esk3_2(X8,X9))
| pre_order(X8,X9) )
& ( ~ apply(X8,esk4_2(X8,X9),esk6_2(X8,X9))
| ~ apply(X8,esk3_2(X8,X9),esk3_2(X8,X9))
| pre_order(X8,X9) ) ),
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)],[pre_order])])])])])])]) ).
cnf(c_0_13,hypothesis,
( apply(subset_predicate,X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
subset(X1,X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
( member(X1,power_set(X2))
| ~ apply(subset_predicate,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( pre_order(X1,X2)
| apply(X1,esk5_2(X1,X2),esk6_2(X1,X2))
| ~ apply(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
apply(subset_predicate,X1,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,hypothesis,
( pre_order(subset_predicate,X1)
| member(esk5_2(subset_predicate,X1),power_set(esk6_2(subset_predicate,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( pre_order(X1,X2)
| apply(X1,esk4_2(X1,X2),esk5_2(X1,X2))
| ~ apply(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,hypothesis,
( pre_order(subset_predicate,X1)
| subset(esk5_2(subset_predicate,X1),esk6_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
( pre_order(subset_predicate,X1)
| member(esk4_2(subset_predicate,X1),power_set(esk5_2(subset_predicate,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_17])]) ).
cnf(c_0_24,hypothesis,
( pre_order(subset_predicate,X1)
| member(X2,esk6_2(subset_predicate,X1))
| ~ member(X2,esk5_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,hypothesis,
( pre_order(subset_predicate,X1)
| subset(esk4_2(subset_predicate,X1),esk5_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_26,hypothesis,
( pre_order(subset_predicate,X1)
| subset(X2,esk6_2(subset_predicate,X1))
| ~ member(esk2_2(X2,esk6_2(subset_predicate,X1)),esk5_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_24]) ).
cnf(c_0_27,hypothesis,
( pre_order(subset_predicate,X1)
| member(X2,esk5_2(subset_predicate,X1))
| ~ member(X2,esk4_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_28,hypothesis,
( pre_order(subset_predicate,X1)
| subset(X2,esk6_2(subset_predicate,X1))
| ~ member(esk2_2(X2,esk6_2(subset_predicate,X1)),esk4_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_29,negated_conjecture,
~ ! [X4] : pre_order(subset_predicate,power_set(X4)),
inference(assume_negation,[status(cth)],[thIV18a]) ).
cnf(c_0_30,hypothesis,
( pre_order(subset_predicate,X1)
| subset(esk4_2(subset_predicate,X1),esk6_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
fof(c_0_31,negated_conjecture,
~ pre_order(subset_predicate,power_set(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_32,plain,
( pre_order(X1,X2)
| ~ apply(X1,esk3_2(X1,X2),esk3_2(X1,X2))
| ~ apply(X1,esk4_2(X1,X2),esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,hypothesis,
( pre_order(subset_predicate,X1)
| apply(subset_predicate,esk4_2(subset_predicate,X1),esk6_2(subset_predicate,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
~ pre_order(subset_predicate,power_set(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,hypothesis,
pre_order(subset_predicate,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET807+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 11:11:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.016 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 37
% 0.25/1.43 # Proof object clause steps : 26
% 0.25/1.43 # Proof object formula steps : 11
% 0.25/1.43 # Proof object conjectures : 5
% 0.25/1.43 # Proof object clause conjectures : 2
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 11
% 0.25/1.43 # Proof object initial formulas used : 5
% 0.25/1.43 # Proof object generating inferences : 14
% 0.25/1.43 # Proof object simplifying inferences : 8
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 18
% 0.25/1.43 # Removed by relevancy pruning/SinE : 13
% 0.25/1.43 # Initial clauses : 22
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 22
% 0.25/1.43 # Processed clauses : 78
% 0.25/1.43 # ...of these trivial : 1
% 0.25/1.43 # ...subsumed : 19
% 0.25/1.43 # ...remaining for further processing : 58
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 2
% 0.25/1.43 # Backward-rewritten : 15
% 0.25/1.43 # Generated clauses : 117
% 0.25/1.43 # ...of the previous two non-trivial : 107
% 0.25/1.43 # Contextual simplify-reflections : 3
% 0.25/1.43 # Paramodulations : 117
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 41
% 0.25/1.43 # Positive orientable unit clauses : 4
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 0
% 0.25/1.43 # Non-unit-clauses : 37
% 0.25/1.43 # Current number of unprocessed clauses: 35
% 0.25/1.43 # ...number of literals in the above : 157
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 17
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 388
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 226
% 0.25/1.43 # Non-unit clause-clause subsumptions : 24
% 0.25/1.43 # Unit Clause-clause subsumption calls : 51
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 7
% 0.25/1.43 # BW rewrite match successes : 2
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 3959
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.018 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.022 s
% 0.25/1.43 # Maximum resident set size: 2996 pages
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------