TSTP Solution File: SET631+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:43 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 54 ( 23 ~; 19 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 7 sgn 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',difference_defn) ).
fof(prove_th113,conjecture,
! [X1,X2,X3] :
( intersect(X1,difference(X2,X3))
=> intersect(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th113) ).
fof(symmetry_of_intersect,axiom,
! [X1,X2] :
( intersect(X1,X2)
=> intersect(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetry_of_intersect) ).
fof(c_0_4,plain,
! [X4,X5,X4,X5,X7] :
( ( member(esk4_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk4_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])])])])])])]) ).
fof(c_0_5,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_6,negated_conjecture,
~ ! [X1,X2,X3] :
( intersect(X1,difference(X2,X3))
=> intersect(X1,X2) ),
inference(assume_negation,[status(cth)],[prove_th113]) ).
cnf(c_0_7,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( member(esk4_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( member(esk4_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X3,X4] :
( ~ intersect(X3,X4)
| intersect(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_of_intersect])]) ).
fof(c_0_12,negated_conjecture,
( intersect(esk1_0,difference(esk2_0,esk3_0))
& ~ intersect(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_13,plain,
( intersect(X1,X2)
| ~ intersect(X3,X2)
| ~ member(esk4_2(X3,X2),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,plain,
( member(esk4_2(difference(X1,X2),X3),X1)
| ~ intersect(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
intersect(esk1_0,difference(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( intersect(X1,X2)
| ~ intersect(difference(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
intersect(difference(esk2_0,esk3_0),esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
intersect(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
~ intersect(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n021.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 : Sat Jul 9 23:50:22 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.014 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 22
% 0.25/1.44 # Proof object clause steps : 13
% 0.25/1.44 # Proof object formula steps : 9
% 0.25/1.44 # Proof object conjectures : 8
% 0.25/1.44 # Proof object clause conjectures : 5
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 7
% 0.25/1.44 # Proof object initial formulas used : 4
% 0.25/1.44 # Proof object generating inferences : 6
% 0.25/1.44 # Proof object simplifying inferences : 1
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 4
% 0.25/1.44 # Removed by relevancy pruning/SinE : 0
% 0.25/1.44 # Initial clauses : 9
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 9
% 0.25/1.44 # Processed clauses : 21
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 0
% 0.25/1.44 # ...remaining for further processing : 21
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 0
% 0.25/1.44 # Generated clauses : 36
% 0.25/1.44 # ...of the previous two non-trivial : 26
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 36
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 21
% 0.25/1.44 # Positive orientable unit clauses : 5
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 3
% 0.25/1.44 # Non-unit-clauses : 13
% 0.25/1.44 # Current number of unprocessed clauses: 14
% 0.25/1.44 # ...number of literals in the above : 34
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 0
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 24
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 24
% 0.25/1.44 # Non-unit clause-clause subsumptions : 0
% 0.25/1.44 # Unit Clause-clause subsumption calls : 5
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 0
% 0.25/1.44 # BW rewrite match successes : 0
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 890
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.015 s
% 0.25/1.44 # System time : 0.001 s
% 0.25/1.44 # Total time : 0.016 s
% 0.25/1.44 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------