TSTP Solution File: SET603+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET603+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:52:23 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 11 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 63 ( 27 ~; 24 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 10 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI30,conjecture,
! [X4] : equal_set(difference(X4,empty_set),X4),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI30) ).
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',difference) ).
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(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(c_0_5,negated_conjecture,
~ ! [X4] : equal_set(difference(X4,empty_set),X4),
inference(assume_negation,[status(cth)],[thI30]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X5,X6,X7] :
( ( member(X5,X7)
| ~ member(X5,difference(X7,X6)) )
& ( ~ member(X5,X6)
| ~ member(X5,difference(X7,X6)) )
& ( ~ member(X5,X7)
| member(X5,X6)
| member(X5,difference(X7,X6)) ) ),
inference(distribute,[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)],[difference])])])])])]) ).
fof(c_0_7,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_8,negated_conjecture,
~ equal_set(difference(esk1_0,empty_set),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,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_10,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
~ equal_set(difference(esk1_0,empty_set),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( member(esk2_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_17,plain,
! [X4] : ~ member(X4,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set])]) ).
cnf(c_0_18,plain,
( member(esk2_2(X1,difference(X2,X3)),X3)
| subset(X1,difference(X2,X3))
| ~ member(esk2_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ subset(esk1_0,difference(esk1_0,empty_set))
| ~ subset(difference(esk1_0,empty_set),esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( member(esk2_2(X1,difference(X1,X2)),X2)
| subset(X1,difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_23,negated_conjecture,
~ subset(esk1_0,difference(esk1_0,empty_set)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_24,plain,
subset(X1,difference(X1,empty_set)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET603+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 20:21:59 EDT 2022
% 0.14/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.014 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 : 26
% 0.25/1.43 # Proof object clause steps : 15
% 0.25/1.43 # Proof object formula steps : 11
% 0.25/1.43 # Proof object conjectures : 7
% 0.25/1.43 # Proof object clause conjectures : 4
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 7
% 0.25/1.43 # Proof object initial formulas used : 5
% 0.25/1.43 # Proof object generating inferences : 6
% 0.25/1.43 # Proof object simplifying inferences : 4
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 12
% 0.25/1.43 # Removed by relevancy pruning/SinE : 7
% 0.25/1.43 # Initial clauses : 11
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 11
% 0.25/1.43 # Processed clauses : 47
% 0.25/1.43 # ...of these trivial : 2
% 0.25/1.43 # ...subsumed : 8
% 0.25/1.43 # ...remaining for further processing : 37
% 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 : 0
% 0.25/1.43 # Backward-rewritten : 2
% 0.25/1.43 # Generated clauses : 88
% 0.25/1.43 # ...of the previous two non-trivial : 76
% 0.25/1.43 # Contextual simplify-reflections : 4
% 0.25/1.43 # Paramodulations : 88
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 35
% 0.25/1.43 # Positive orientable unit clauses : 10
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 23
% 0.25/1.43 # Current number of unprocessed clauses: 40
% 0.25/1.43 # ...number of literals in the above : 79
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 2
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 121
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 119
% 0.25/1.43 # Non-unit clause-clause subsumptions : 10
% 0.25/1.43 # Unit Clause-clause subsumption calls : 34
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 20
% 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 : 1830
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.015 s
% 0.25/1.43 # System time : 0.002 s
% 0.25/1.43 # Total time : 0.017 s
% 0.25/1.43 # Maximum resident set size: 2816 pages
%------------------------------------------------------------------------------