%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET013+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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:07:58 EDT 2022
% Result : Theorem 8.76s 2.52s
% Output : CNFRefutation 8.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 80 ( 36 ~; 32 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 37 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI06,conjecture,
! [X1,X2] : equal_set(intersection(X1,X2),intersection(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI06) ).
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(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] : equal_set(intersection(X1,X2),intersection(X2,X1)),
inference(assume_negation,[status(cth)],[thI06]) ).
fof(c_0_5,negated_conjecture,
~ equal_set(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,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_7,negated_conjecture,
~ equal_set(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,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_10,negated_conjecture,
( ~ subset(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0))
| ~ subset(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X16,X17,X18] :
( ( member(X16,X17)
| ~ member(X16,intersection(X17,X18)) )
& ( member(X16,X18)
| ~ member(X16,intersection(X17,X18)) )
& ( ~ member(X16,X17)
| ~ member(X16,X18)
| member(X16,intersection(X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])]) ).
cnf(c_0_14,negated_conjecture,
( member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk4_0))
| ~ subset(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk4_0,esk5_0))
| ~ subset(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk4_0))
| ~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_18,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk4_0,esk5_0))
| member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk4_0,esk5_0))
| ~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_21,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),esk4_0)
| ~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),esk5_0)
| ~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk4_0,esk5_0))
| ~ member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk4_0,esk5_0))
| member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk4_0,esk5_0))
| member(esk1_2(intersection(esk5_0,esk4_0),intersection(esk4_0,esk5_0)),esk5_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk5_0,esk4_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),intersection(esk4_0,esk5_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),esk4_0)
| ~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),esk5_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),esk4_0),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ member(esk1_2(intersection(esk4_0,esk5_0),intersection(esk5_0,esk4_0)),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_28]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET013+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 : 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 20:55:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.76/2.52 # ENIGMATIC: Solved by autoschedule:
% 8.76/2.52 # No SInE strategy applied
% 8.76/2.52 # Trying AutoSched0 for 150 seconds
% 8.76/2.52 # AutoSched0-Mode selected heuristic G_E___208_C09_12_F1_SE_CS_SP_PS_S070I
% 8.76/2.52 # and selection function SelectVGNonCR.
% 8.76/2.52 #
% 8.76/2.52 # Preprocessing time : 0.026 s
% 8.76/2.52 # Presaturation interreduction done
% 8.76/2.52
% 8.76/2.52 # Proof found!
% 8.76/2.52 # SZS status Theorem
% 8.76/2.52 # SZS output start CNFRefutation
% See solution above
% 8.76/2.52 # Training examples: 0 positive, 0 negative
% 8.76/2.52
% 8.76/2.52 # -------------------------------------------------
% 8.76/2.52 # User time : 0.034 s
% 8.76/2.52 # System time : 0.006 s
% 8.76/2.52 # Total time : 0.040 s
% 8.76/2.52 # Maximum resident set size: 7120 pages
% 8.76/2.52
%------------------------------------------------------------------------------