%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET702+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:13:33 EDT 2022
% Result : Theorem 9.28s 2.63s
% Output : CNFRefutation 9.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 28 ~; 27 |; 8 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 1 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI36,conjecture,
! [X1,X2] : subset(intersection(product(X1),product(X2)),product(intersection(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI36) ).
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(product,axiom,
! [X3,X1] :
( member(X3,product(X1))
<=> ! [X5] :
( member(X5,X1)
=> member(X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',product) ).
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',power_set) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] : subset(intersection(product(X1),product(X2)),product(intersection(X1,X2))),
inference(assume_negation,[status(cth)],[thI36]) ).
fof(c_0_6,negated_conjecture,
~ subset(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,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])])])])])]) ).
fof(c_0_8,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_9,negated_conjecture,
~ subset(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X37,X38,X39,X40,X41] :
( ( ~ member(X37,product(X38))
| ~ member(X39,X38)
| member(X37,X39) )
& ( member(esk3_2(X40,X41),X41)
| member(X40,product(X41)) )
& ( ~ member(X40,esk3_2(X40,X41))
| member(X40,product(X41)) ) ),
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)],[product])])])])])]) ).
cnf(c_0_12,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
member(esk1_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),intersection(product(esk4_0),product(esk5_0))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_14,plain,
! [X14,X15] :
( ( ~ member(X14,power_set(X15))
| subset(X14,X15) )
& ( ~ subset(X14,X15)
| member(X14,power_set(X15)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])]) ).
cnf(c_0_15,plain,
( member(X1,X3)
| ~ member(X1,product(X2))
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
member(esk1_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),product(esk4_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( member(X1,product(X2))
| ~ member(X1,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( member(esk1_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),X1)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( member(esk3_2(X1,X2),X2)
| member(X1,product(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
( member(X1,power_set(X2))
| ~ member(esk1_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( member(esk1_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),product(X1))
| ~ member(esk3_2(esk1_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),X1),esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ member(intersection(product(esk4_0),product(esk5_0)),power_set(product(intersection(esk4_0,esk5_0)))),
inference(spm,[status(thm)],[c_0_9,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ member(esk1_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),product(intersection(esk4_0,esk5_0))),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_27,plain,
( member(esk3_2(X1,intersection(X2,X3)),X2)
| member(X1,product(intersection(X2,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ member(esk3_2(esk1_2(intersection(product(esk4_0),product(esk5_0)),product(intersection(esk4_0,esk5_0))),intersection(esk4_0,esk5_0)),esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET702+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.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 16:05:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.28/2.63 # ENIGMATIC: Solved by autoschedule:
% 9.28/2.63 # No SInE strategy applied
% 9.28/2.63 # Trying AutoSched0 for 150 seconds
% 9.28/2.63 # AutoSched0-Mode selected heuristic G_E___208_C09_12_F1_SE_CS_SP_PS_S070I
% 9.28/2.63 # and selection function SelectVGNonCR.
% 9.28/2.63 #
% 9.28/2.63 # Preprocessing time : 0.026 s
% 9.28/2.63 # Presaturation interreduction done
% 9.28/2.63
% 9.28/2.63 # Proof found!
% 9.28/2.63 # SZS status Theorem
% 9.28/2.63 # SZS output start CNFRefutation
% See solution above
% 9.28/2.63 # Training examples: 0 positive, 0 negative
% 9.28/2.63
% 9.28/2.63 # -------------------------------------------------
% 9.28/2.63 # User time : 0.076 s
% 9.28/2.63 # System time : 0.007 s
% 9.28/2.63 # Total time : 0.083 s
% 9.28/2.63 # Maximum resident set size: 7124 pages
% 9.28/2.63
%------------------------------------------------------------------------------