TSTP Solution File: SET602+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET602+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:12:39 EDT 2022
% Result : Theorem 7.88s 2.39s
% Output : CNFRefutation 7.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 27 ~; 19 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 3 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI29,conjecture,
! [X4] : equal_set(difference(X4,X4),empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI29) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',difference) ).
fof(c_0_5,negated_conjecture,
~ ! [X4] : equal_set(difference(X4,X4),empty_set),
inference(assume_negation,[status(cth)],[thI29]) ).
fof(c_0_6,negated_conjecture,
~ equal_set(difference(esk4_0,esk4_0),empty_set),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X12,X13] :
( ( subset(X12,X13)
| ~ equal_set(X12,X13) )
& ( subset(X13,X12)
| ~ equal_set(X12,X13) )
& ( ~ subset(X12,X13)
| ~ subset(X13,X12)
| equal_set(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_8,negated_conjecture,
~ equal_set(difference(esk4_0,esk4_0),empty_set),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ member(X8,X6)
| member(X8,X7) )
& ( member(esk1_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ member(esk1_2(X9,X10),X10)
| subset(X9,X10) ) ),
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)],[subset])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ subset(empty_set,difference(esk4_0,esk4_0))
| ~ subset(difference(esk4_0,esk4_0),empty_set) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X22] : ~ member(X22,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set])]) ).
fof(c_0_14,plain,
! [X23,X24,X25] :
( ( member(X23,X25)
| ~ member(X23,difference(X25,X24)) )
& ( ~ member(X23,X24)
| ~ member(X23,difference(X25,X24)) )
& ( ~ member(X23,X25)
| member(X23,X24)
| member(X23,difference(X25,X24)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[difference])])])]) ).
cnf(c_0_15,negated_conjecture,
( member(esk1_2(difference(esk4_0,esk4_0),empty_set),difference(esk4_0,esk4_0))
| ~ subset(empty_set,difference(esk4_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
member(esk1_2(difference(esk4_0,esk4_0),empty_set),difference(esk4_0,esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_16]) ).
cnf(c_0_19,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
~ member(esk1_2(difference(esk4_0,esk4_0),empty_set),esk4_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET602+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 20:17:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.88/2.39 # ENIGMATIC: Solved by autoschedule:
% 7.88/2.39 # No SInE strategy applied
% 7.88/2.39 # Trying AutoSched0 for 150 seconds
% 7.88/2.39 # AutoSched0-Mode selected heuristic G_E___208_C09_12_F1_SE_CS_SP_PS_S070I
% 7.88/2.39 # and selection function SelectVGNonCR.
% 7.88/2.39 #
% 7.88/2.39 # Preprocessing time : 0.014 s
% 7.88/2.39 # Presaturation interreduction done
% 7.88/2.39
% 7.88/2.39 # Proof found!
% 7.88/2.39 # SZS status Theorem
% 7.88/2.39 # SZS output start CNFRefutation
% See solution above
% 7.88/2.39 # Training examples: 0 positive, 0 negative
% 7.88/2.39
% 7.88/2.39 # -------------------------------------------------
% 7.88/2.39 # User time : 0.013 s
% 7.88/2.39 # System time : 0.008 s
% 7.88/2.39 # Total time : 0.021 s
% 7.88/2.39 # Maximum resident set size: 7124 pages
% 7.88/2.39
%------------------------------------------------------------------------------