TSTP Solution File: SET095+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET095+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:09:22 EDT 2022
% Result : Theorem 7.43s 2.40s
% Output : CNFRefutation 7.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 47 ( 12 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 43 ( 15 ~; 16 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(property_of_singletons2,conjecture,
! [X1,X2] :
( member(X1,X2)
=> subclass(singleton(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_singletons2) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( member(X1,X2)
=> subclass(singleton(X1),X2) ),
inference(assume_negation,[status(cth)],[property_of_singletons2]) ).
fof(c_0_5,negated_conjecture,
( member(esk8_0,esk9_0)
& ~ subclass(singleton(esk8_0),esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
cnf(c_0_7,negated_conjecture,
~ subclass(singleton(esk8_0),esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X10,X11,X12,X13,X14] :
( ( ~ subclass(X10,X11)
| ~ member(X12,X10)
| member(X12,X11) )
& ( member(esk1_2(X13,X14),X13)
| subclass(X13,X14) )
& ( ~ member(esk1_2(X13,X14),X14)
| subclass(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subclass_defn])])])])])]) ).
fof(c_0_10,plain,
! [X19,X20,X21] :
( ( member(X19,universal_class)
| ~ member(X19,unordered_pair(X20,X21)) )
& ( X19 = X20
| X19 = X21
| ~ member(X19,unordered_pair(X20,X21)) )
& ( X19 != X20
| ~ member(X19,universal_class)
| member(X19,unordered_pair(X20,X21)) )
& ( X19 != X21
| ~ member(X19,universal_class)
| member(X19,unordered_pair(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])]) ).
cnf(c_0_11,negated_conjecture,
~ subclass(unordered_pair(esk8_0,esk8_0),esk9_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( member(esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
member(esk1_2(unordered_pair(esk8_0,esk8_0),esk9_0),unordered_pair(esk8_0,esk8_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
esk1_2(unordered_pair(esk8_0,esk8_0),esk9_0) = esk8_0,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
member(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET095+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n026.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 : Sun Jul 10 13:29:13 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.43/2.40 # ENIGMATIC: Solved by autoschedule:
% 7.43/2.40 # No SInE strategy applied
% 7.43/2.40 # Trying AutoSched0 for 150 seconds
% 7.43/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S026I
% 7.43/2.40 # and selection function SelectOptimalRestrNDepth2.
% 7.43/2.40 #
% 7.43/2.40 # Preprocessing time : 0.029 s
% 7.43/2.40 # Presaturation interreduction done
% 7.43/2.40
% 7.43/2.40 # Proof found!
% 7.43/2.40 # SZS status Theorem
% 7.43/2.40 # SZS output start CNFRefutation
% See solution above
% 7.43/2.40 # Training examples: 0 positive, 0 negative
% 7.43/2.40
% 7.43/2.40 # -------------------------------------------------
% 7.43/2.40 # User time : 0.038 s
% 7.43/2.40 # System time : 0.006 s
% 7.43/2.40 # Total time : 0.044 s
% 7.43/2.40 # Maximum resident set size: 7124 pages
% 7.43/2.40
%------------------------------------------------------------------------------