TSTP Solution File: SET903+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET903+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:19 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 76 ( 75 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 91 ( 33 ~; 36 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 4 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t43_zfmisc_1,axiom,
! [X1,X2,X3] :
~ ( singleton(X1) = set_union2(X2,X3)
& ~ ( X2 = singleton(X1)
& X3 = singleton(X1) )
& ~ ( X2 = empty_set
& X3 = singleton(X1) )
& ~ ( X2 = singleton(X1)
& X3 = empty_set ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t43_zfmisc_1) ).
fof(t44_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( singleton(X1) = set_union2(X2,X3)
& X2 != X3
& X2 != empty_set
& X3 != empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t44_zfmisc_1) ).
fof(c_0_2,plain,
! [X4,X5,X6] :
( ( X5 = singleton(X4)
| X5 = empty_set
| X5 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) )
& ( X6 = empty_set
| X5 = empty_set
| X5 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) )
& ( X5 = singleton(X4)
| X6 = singleton(X4)
| X5 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) )
& ( X6 = empty_set
| X6 = singleton(X4)
| X5 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) )
& ( X5 = singleton(X4)
| X5 = empty_set
| X6 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) )
& ( X6 = empty_set
| X5 = empty_set
| X6 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) )
& ( X5 = singleton(X4)
| X6 = singleton(X4)
| X6 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) )
& ( X6 = empty_set
| X6 = singleton(X4)
| X6 = singleton(X4)
| singleton(X4) != set_union2(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t43_zfmisc_1])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( singleton(X1) = set_union2(X2,X3)
& X2 != X3
& X2 != empty_set
& X3 != empty_set ),
inference(assume_negation,[status(cth)],[t44_zfmisc_1]) ).
cnf(c_0_4,plain,
( X3 = singleton(X1)
| X3 = singleton(X1)
| X3 = empty_set
| singleton(X1) != set_union2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
( singleton(esk1_0) = set_union2(esk2_0,esk3_0)
& esk2_0 != esk3_0
& esk2_0 != empty_set
& esk3_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( X3 = empty_set
| X3 = singleton(X1)
| singleton(X1) != set_union2(X2,X3) ),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
singleton(esk1_0) = set_union2(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk3_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( singleton(X1) = esk3_0
| singleton(X1) != singleton(esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,plain,
( X2 = singleton(X1)
| X2 = empty_set
| X2 = singleton(X1)
| singleton(X1) != set_union2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
singleton(esk1_0) = esk3_0,
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( X2 = empty_set
| X2 = singleton(X1)
| singleton(X1) != set_union2(X2,X3) ),
inference(cn,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
set_union2(esk2_0,esk3_0) = esk3_0,
inference(rw,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( singleton(X1) = esk2_0
| singleton(X1) != esk3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET903+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.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 : Sat Jul 9 17:43:26 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.015 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 : 18
% 0.21/1.40 # Proof object clause steps : 13
% 0.21/1.40 # Proof object formula steps : 5
% 0.21/1.40 # Proof object conjectures : 12
% 0.21/1.40 # Proof object clause conjectures : 9
% 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 : 2
% 0.21/1.40 # Proof object generating inferences : 4
% 0.21/1.40 # Proof object simplifying inferences : 6
% 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 : 0
% 0.21/1.40 # Initial clauses : 19
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 19
% 0.21/1.40 # Processed clauses : 24
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 5
% 0.21/1.40 # ...remaining for further processing : 19
% 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 : 0
% 0.21/1.40 # Backward-rewritten : 3
% 0.21/1.40 # Generated clauses : 29
% 0.21/1.40 # ...of the previous two non-trivial : 19
% 0.21/1.40 # Contextual simplify-reflections : 4
% 0.21/1.40 # Paramodulations : 28
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 1
% 0.21/1.40 # Current number of processed clauses : 16
% 0.21/1.40 # Positive orientable unit clauses : 5
% 0.21/1.40 # Positive unorientable unit clauses: 1
% 0.21/1.40 # Negative unit clauses : 4
% 0.21/1.40 # Non-unit-clauses : 6
% 0.21/1.40 # Current number of unprocessed clauses: 11
% 0.21/1.40 # ...number of literals in the above : 28
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 3
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 21
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 21
% 0.21/1.40 # Non-unit clause-clause subsumptions : 9
% 0.21/1.40 # Unit Clause-clause subsumption calls : 0
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 5
% 0.21/1.40 # BW rewrite match successes : 5
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 761
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.014 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.016 s
% 0.21/1.40 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------