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