TSTP Solution File: SET351+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET351+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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:50:52 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 75 ( 6 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 76 ( 32 ~; 30 |; 9 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 60 ( 8 sgn 29 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(singleton,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(sum,axiom,
! [X3,X1] :
( member(X3,sum(X1))
<=> ? [X5] :
( member(X5,X1)
& member(X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',sum) ).
fof(thI39,conjecture,
! [X1] : equal_set(sum(singleton(X1)),X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI39) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(c_0_5,plain,
! [X4,X5,X4,X5] :
( ( ~ member(X4,singleton(X5))
| X4 = X5 )
& ( X4 != X5
| member(X4,singleton(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])])])]) ).
fof(c_0_6,plain,
! [X6,X7,X6,X7,X9] :
( ( member(esk2_2(X6,X7),X7)
| ~ member(X6,sum(X7)) )
& ( member(X6,esk2_2(X6,X7))
| ~ member(X6,sum(X7)) )
& ( ~ member(X9,X7)
| ~ member(X6,X9)
| member(X6,sum(X7)) ) ),
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)],[sum])])])])])])]) ).
cnf(c_0_7,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] : equal_set(sum(singleton(X1)),X1),
inference(assume_negation,[status(cth)],[thI39]) ).
fof(c_0_9,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk3_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])])])])])])]) ).
cnf(c_0_10,plain,
( member(X1,sum(X2))
| ~ member(X1,X3)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
member(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( member(esk2_2(X1,X2),X2)
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,negated_conjecture,
~ equal_set(sum(singleton(esk1_0)),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_15,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| ~ equal_set(X3,X4) )
& ( subset(X4,X3)
| ~ equal_set(X3,X4) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| equal_set(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])])]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( member(X1,sum(singleton(X2)))
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( member(X1,esk2_2(X1,X2))
| ~ member(X1,sum(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( esk2_2(X1,singleton(X2)) = X2
| ~ member(X1,sum(singleton(X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
~ equal_set(sum(singleton(esk1_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( subset(X1,sum(singleton(X2)))
| ~ member(esk3_2(X1,sum(singleton(X2))),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( member(X1,X2)
| ~ member(X1,sum(singleton(X2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( ~ subset(esk1_0,sum(singleton(esk1_0)))
| ~ subset(sum(singleton(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
subset(X1,sum(singleton(X1))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( member(esk3_2(sum(singleton(X1)),X2),X1)
| subset(sum(singleton(X1)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ subset(sum(singleton(esk1_0)),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,plain,
subset(sum(singleton(X1)),X1),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET351+4 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n011.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 Jul 11 04:11:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.015 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 31
% 0.22/1.41 # Proof object clause steps : 20
% 0.22/1.41 # Proof object formula steps : 11
% 0.22/1.41 # Proof object conjectures : 7
% 0.22/1.41 # Proof object clause conjectures : 4
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 9
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 8
% 0.22/1.41 # Proof object simplifying inferences : 5
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 12
% 0.22/1.41 # Removed by relevancy pruning/SinE : 7
% 0.22/1.41 # Initial clauses : 12
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 12
% 0.22/1.41 # Processed clauses : 37
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 2
% 0.22/1.41 # ...remaining for further processing : 35
% 0.22/1.41 # Other redundant clauses eliminated : 1
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 2
% 0.22/1.41 # Generated clauses : 76
% 0.22/1.41 # ...of the previous two non-trivial : 67
% 0.22/1.41 # Contextual simplify-reflections : 1
% 0.22/1.41 # Paramodulations : 75
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 1
% 0.22/1.41 # Current number of processed clauses : 32
% 0.22/1.41 # Positive orientable unit clauses : 5
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 1
% 0.22/1.41 # Non-unit-clauses : 26
% 0.22/1.41 # Current number of unprocessed clauses: 42
% 0.22/1.41 # ...number of literals in the above : 116
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 2
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 62
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 61
% 0.22/1.41 # Non-unit clause-clause subsumptions : 3
% 0.22/1.41 # Unit Clause-clause subsumption calls : 9
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 12
% 0.22/1.41 # BW rewrite match successes : 2
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 1842
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.016 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.018 s
% 0.22/1.41 # Maximum resident set size: 2816 pages
% 0.22/23.41 eprover: CPU time limit exceeded, terminating
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------