TSTP Solution File: SET603+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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:22 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 48 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 45 ( 18 ~; 20 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 5 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',difference_defn) ).
fof(member_equal,axiom,
! [X1,X2] :
( ! [X3] :
( member(X3,X1)
<=> member(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',member_equal) ).
fof(prove_th74,conjecture,
! [X1] : difference(X1,empty_set) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th74) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',empty_set_defn) ).
fof(c_0_4,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(X4,X5)) ) ),
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_defn])])])])])]) ).
fof(c_0_5,plain,
! [X4,X5] :
( ( ~ member(esk2_2(X4,X5),X4)
| ~ member(esk2_2(X4,X5),X5)
| X4 = X5 )
& ( member(esk2_2(X4,X5),X4)
| member(esk2_2(X4,X5),X5)
| X4 = X5 ) ),
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)],[member_equal])])])])])]) ).
cnf(c_0_6,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( difference(X1,X2) = X3
| member(esk2_2(difference(X1,X2),X3),X3)
| member(esk2_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( difference(X1,X2) = X1
| member(esk2_2(difference(X1,X2),X1),X1) ),
inference(ef,[status(thm)],[c_0_8]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] : difference(X1,empty_set) = X1,
inference(assume_negation,[status(cth)],[prove_th74]) ).
fof(c_0_12,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set_defn])]) ).
cnf(c_0_13,plain,
( difference(X1,X2) = X1
| ~ member(esk2_2(difference(X1,X2),X1),difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_15,negated_conjecture,
difference(esk1_0,empty_set) != esk1_0,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_16,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( difference(X1,X2) = X1
| member(esk2_2(difference(X1,X2),X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10]) ).
cnf(c_0_18,negated_conjecture,
difference(esk1_0,empty_set) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
difference(X1,empty_set) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n022.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 : Sun Jul 10 14:39:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.014 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 21
% 0.21/1.40 # Proof object clause steps : 12
% 0.21/1.40 # Proof object formula steps : 9
% 0.21/1.40 # Proof object conjectures : 5
% 0.21/1.40 # Proof object clause conjectures : 2
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 6
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 5
% 0.21/1.40 # Proof object simplifying inferences : 3
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 9
% 0.21/1.40 # Removed by relevancy pruning/SinE : 4
% 0.21/1.40 # Initial clauses : 11
% 0.21/1.40 # Removed in clause preprocessing : 2
% 0.21/1.40 # Initial clauses in saturation : 9
% 0.21/1.40 # Processed clauses : 124
% 0.21/1.40 # ...of these trivial : 2
% 0.21/1.40 # ...subsumed : 70
% 0.21/1.40 # ...remaining for further processing : 52
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 6
% 0.21/1.40 # Backward-rewritten : 1
% 0.21/1.40 # Generated clauses : 302
% 0.21/1.40 # ...of the previous two non-trivial : 185
% 0.21/1.40 # Contextual simplify-reflections : 18
% 0.21/1.40 # Paramodulations : 290
% 0.21/1.40 # Factorizations : 12
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 45
% 0.21/1.40 # Positive orientable unit clauses : 4
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 1
% 0.21/1.40 # Non-unit-clauses : 40
% 0.21/1.40 # Current number of unprocessed clauses: 62
% 0.21/1.40 # ...number of literals in the above : 171
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 7
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 471
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 414
% 0.21/1.40 # Non-unit clause-clause subsumptions : 81
% 0.21/1.40 # Unit Clause-clause subsumption calls : 35
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 6
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 4294
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.019 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.021 s
% 0.21/1.40 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------