TSTP Solution File: SET639+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET639+3 : TPTP v8.1.0. Released v2.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:52:48 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 24 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 6 ~; 3 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th121,conjecture,
! [X1,X2] :
( ( subset(X1,X2)
& intersection(X2,X1) = empty_set )
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th121) ).
fof(subset_intersection,axiom,
! [X1,X2] :
( subset(X1,X2)
=> intersection(X1,X2) = X1 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_intersection) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_of_intersection) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( subset(X1,X2)
& intersection(X2,X1) = empty_set )
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[prove_th121]) ).
fof(c_0_4,plain,
! [X3,X4] :
( ~ subset(X3,X4)
| intersection(X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subset_intersection])]) ).
fof(c_0_5,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_6,negated_conjecture,
( subset(esk1_0,esk2_0)
& intersection(esk2_0,esk1_0) = empty_set
& esk1_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_7,plain,
( intersection(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
intersection(esk2_0,esk1_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( intersection(X1,X2) = X2
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET639+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 9 21:26:10 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.014 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 14
% 0.23/1.41 # Proof object clause steps : 7
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 7
% 0.23/1.41 # Proof object clause conjectures : 4
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 5
% 0.23/1.41 # Proof object initial formulas used : 3
% 0.23/1.41 # Proof object generating inferences : 2
% 0.23/1.41 # Proof object simplifying inferences : 3
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 10
% 0.23/1.41 # Removed by relevancy pruning/SinE : 1
% 0.23/1.41 # Initial clauses : 20
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 18
% 0.23/1.41 # Processed clauses : 25
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 25
% 0.23/1.41 # Other redundant clauses eliminated : 2
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 52
% 0.23/1.41 # ...of the previous two non-trivial : 34
% 0.23/1.41 # Contextual simplify-reflections : 1
% 0.23/1.41 # Paramodulations : 48
% 0.23/1.41 # Factorizations : 2
% 0.23/1.41 # Equation resolutions : 2
% 0.23/1.41 # Current number of processed clauses : 23
% 0.23/1.41 # Positive orientable unit clauses : 4
% 0.23/1.41 # Positive unorientable unit clauses: 1
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 15
% 0.23/1.41 # Current number of unprocessed clauses: 27
% 0.23/1.41 # ...number of literals in the above : 65
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 16
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 16
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1
% 0.23/1.41 # Unit Clause-clause subsumption calls : 1
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 4
% 0.23/1.41 # BW rewrite match successes : 4
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1335
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.012 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.016 s
% 0.23/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------