TSTP Solution File: SET625+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:39 EDT 2022
% Result : Theorem 0.30s 1.47s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 56 ( 22 ~; 20 |; 9 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 4 sgn 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th101,conjecture,
! [X1,X2,X3] :
( ( intersect(X1,X2)
& subset(X2,X3) )
=> intersect(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th101) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_defn) ).
fof(intersect_defn,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',intersect_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( intersect(X1,X2)
& subset(X2,X3) )
=> intersect(X1,X3) ),
inference(assume_negation,[status(cth)],[prove_th101]) ).
fof(c_0_4,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_defn])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( intersect(esk3_0,esk4_0)
& subset(esk4_0,esk5_0)
& ~ intersect(esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X4,X5,X4,X5,X7] :
( ( member(esk1_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk1_2(X4,X5),X5)
| ~ intersect(X4,X5) )
& ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(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)],[intersect_defn])])])])])])]) ).
cnf(c_0_7,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( member(X1,esk5_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( intersect(X1,esk5_0)
| ~ member(X2,esk4_0)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( intersect(X1,esk5_0)
| ~ member(esk1_2(X2,esk4_0),X1)
| ~ intersect(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
~ intersect(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( intersect(X1,esk5_0)
| ~ intersect(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
intersect(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.16/0.37 % Computer : n006.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Sun Jul 10 11:13:06 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.30/1.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.30/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.30/1.47 # Preprocessing time : 0.014 s
% 0.30/1.47
% 0.30/1.47 # Failure: Out of unprocessed clauses!
% 0.30/1.47 # OLD status GaveUp
% 0.30/1.47 # Parsed axioms : 5
% 0.30/1.47 # Removed by relevancy pruning/SinE : 2
% 0.30/1.47 # Initial clauses : 5
% 0.30/1.47 # Removed in clause preprocessing : 0
% 0.30/1.47 # Initial clauses in saturation : 5
% 0.30/1.47 # Processed clauses : 6
% 0.30/1.47 # ...of these trivial : 0
% 0.30/1.47 # ...subsumed : 0
% 0.30/1.47 # ...remaining for further processing : 6
% 0.30/1.47 # Other redundant clauses eliminated : 0
% 0.30/1.47 # Clauses deleted for lack of memory : 0
% 0.30/1.47 # Backward-subsumed : 0
% 0.30/1.47 # Backward-rewritten : 0
% 0.30/1.47 # Generated clauses : 2
% 0.30/1.47 # ...of the previous two non-trivial : 1
% 0.30/1.47 # Contextual simplify-reflections : 0
% 0.30/1.47 # Paramodulations : 2
% 0.30/1.47 # Factorizations : 0
% 0.30/1.47 # Equation resolutions : 0
% 0.30/1.47 # Current number of processed clauses : 6
% 0.30/1.47 # Positive orientable unit clauses : 4
% 0.30/1.47 # Positive unorientable unit clauses: 0
% 0.30/1.47 # Negative unit clauses : 1
% 0.30/1.47 # Non-unit-clauses : 1
% 0.30/1.47 # Current number of unprocessed clauses: 0
% 0.30/1.47 # ...number of literals in the above : 0
% 0.30/1.47 # Current number of archived formulas : 0
% 0.30/1.47 # Current number of archived clauses : 0
% 0.30/1.47 # Clause-clause subsumption calls (NU) : 0
% 0.30/1.47 # Rec. Clause-clause subsumption calls : 0
% 0.30/1.47 # Non-unit clause-clause subsumptions : 0
% 0.30/1.47 # Unit Clause-clause subsumption calls : 0
% 0.30/1.47 # Rewrite failures with RHS unbound : 0
% 0.30/1.47 # BW rewrite match attempts : 0
% 0.30/1.47 # BW rewrite match successes : 0
% 0.30/1.47 # Condensation attempts : 0
% 0.30/1.47 # Condensation successes : 0
% 0.30/1.47 # Termbank termtop insertions : 223
% 0.30/1.47
% 0.30/1.47 # -------------------------------------------------
% 0.30/1.47 # User time : 0.011 s
% 0.30/1.47 # System time : 0.003 s
% 0.30/1.47 # Total time : 0.015 s
% 0.30/1.47 # Maximum resident set size: 2764 pages
% 0.30/1.47 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.30/1.47 # Preprocessing time : 0.014 s
% 0.30/1.47
% 0.30/1.47 # Proof found!
% 0.30/1.47 # SZS status Theorem
% 0.30/1.47 # SZS output start CNFRefutation
% See solution above
% 0.30/1.47 # Proof object total steps : 19
% 0.30/1.47 # Proof object clause steps : 12
% 0.30/1.47 # Proof object formula steps : 7
% 0.30/1.47 # Proof object conjectures : 11
% 0.30/1.47 # Proof object clause conjectures : 8
% 0.30/1.47 # Proof object formula conjectures : 3
% 0.30/1.47 # Proof object initial clauses used : 7
% 0.30/1.47 # Proof object initial formulas used : 3
% 0.30/1.47 # Proof object generating inferences : 5
% 0.30/1.47 # Proof object simplifying inferences : 2
% 0.30/1.47 # Training examples: 0 positive, 0 negative
% 0.30/1.47 # Parsed axioms : 5
% 0.30/1.47 # Removed by relevancy pruning/SinE : 0
% 0.30/1.47 # Initial clauses : 11
% 0.30/1.47 # Removed in clause preprocessing : 0
% 0.30/1.47 # Initial clauses in saturation : 11
% 0.30/1.47 # Processed clauses : 24
% 0.30/1.47 # ...of these trivial : 0
% 0.30/1.47 # ...subsumed : 0
% 0.30/1.47 # ...remaining for further processing : 24
% 0.30/1.47 # Other redundant clauses eliminated : 0
% 0.30/1.47 # Clauses deleted for lack of memory : 0
% 0.30/1.47 # Backward-subsumed : 0
% 0.30/1.47 # Backward-rewritten : 1
% 0.30/1.47 # Generated clauses : 35
% 0.30/1.47 # ...of the previous two non-trivial : 21
% 0.30/1.47 # Contextual simplify-reflections : 0
% 0.30/1.47 # Paramodulations : 35
% 0.30/1.47 # Factorizations : 0
% 0.30/1.47 # Equation resolutions : 0
% 0.30/1.47 # Current number of processed clauses : 23
% 0.30/1.47 # Positive orientable unit clauses : 8
% 0.30/1.47 # Positive unorientable unit clauses: 0
% 0.30/1.47 # Negative unit clauses : 1
% 0.30/1.47 # Non-unit-clauses : 14
% 0.30/1.47 # Current number of unprocessed clauses: 7
% 0.30/1.47 # ...number of literals in the above : 19
% 0.30/1.47 # Current number of archived formulas : 0
% 0.30/1.47 # Current number of archived clauses : 1
% 0.30/1.47 # Clause-clause subsumption calls (NU) : 28
% 0.30/1.47 # Rec. Clause-clause subsumption calls : 28
% 0.30/1.47 # Non-unit clause-clause subsumptions : 0
% 0.30/1.47 # Unit Clause-clause subsumption calls : 0
% 0.30/1.47 # Rewrite failures with RHS unbound : 0
% 0.30/1.47 # BW rewrite match attempts : 2
% 0.30/1.47 # BW rewrite match successes : 1
% 0.30/1.47 # Condensation attempts : 0
% 0.30/1.47 # Condensation successes : 0
% 0.30/1.47 # Termbank termtop insertions : 896
% 0.30/1.47
% 0.30/1.47 # -------------------------------------------------
% 0.30/1.47 # User time : 0.014 s
% 0.30/1.47 # System time : 0.002 s
% 0.30/1.47 # Total time : 0.016 s
% 0.30/1.47 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------