TSTP Solution File: CSR080+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR080+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : Fri Jul 15 02:47:34 EDT 2022
% Result : Theorem 25.03s 5.59s
% Output : CNFRefutation 25.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 18 unt; 0 def)
% Number of atoms : 127 ( 35 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 138 ( 53 ~; 61 |; 17 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 94 ( 50 sgn 22 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
s__part(s__Object6_1,s__Object6_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_3496,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X173,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X171,s__SetOrClass) )
=> ( ( s__instance(X174,X173)
& s__instance(X175,X171)
& s__instance(X176,X172) )
=> ( s__instance(X174,X172)
& s__instance(X175,X172)
& ( s__instance(X176,X173)
| s__instance(X176,X171) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).
fof(kb_SUMO_100,axiom,
! [X15,X16] :
( ( s__instance(X16,s__Substance)
& s__instance(X15,s__Substance) )
=> ( s__piece(X15,X16)
=> s__part(X15,X16) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_100) ).
fof(local_4,axiom,
s__piece(s__Object6_1,s__Object6_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
fof(local_1,axiom,
s__instance(s__Object6_1,s__Substance),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(local_2,axiom,
s__instance(s__Object6_2,s__Substance),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).
fof(c_0_7,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_8,plain,
! [X6422,X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430] :
( ( s__instance(X6425,X6423)
| ~ s__instance(X6425,X6424)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6422,s__SetOrClass)
| X6423 != s__UnionFn(X6424,X6422) )
& ( s__instance(X6426,X6423)
| ~ s__instance(X6425,X6424)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6422,s__SetOrClass)
| X6423 != s__UnionFn(X6424,X6422) )
& ( s__instance(X6427,X6424)
| s__instance(X6427,X6422)
| ~ s__instance(X6425,X6424)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6422,s__SetOrClass)
| X6423 != s__UnionFn(X6424,X6422) )
& ( s__instance(X6430,s__SetOrClass)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(X6429,s__SetOrClass)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(X6428,s__SetOrClass)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(esk158_3(X6428,X6429,X6430),X6430)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(esk159_3(X6428,X6429,X6430),X6428)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(esk160_3(X6428,X6429,X6430),X6429)
| X6429 = s__UnionFn(X6430,X6428) )
& ( ~ s__instance(esk160_3(X6428,X6429,X6430),X6430)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| X6429 = s__UnionFn(X6430,X6428) )
& ( ~ s__instance(esk160_3(X6428,X6429,X6430),X6428)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| X6429 = s__UnionFn(X6430,X6428) ) ),
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)],[kb_SUMO_3496])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X738,X739] :
( ~ s__instance(X739,s__Substance)
| ~ s__instance(X738,s__Substance)
| ~ s__piece(X738,X739)
| s__part(X738,X739) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_100])]) ).
cnf(c_0_12,negated_conjecture,
~ s__part(s__Object6_1,s__Object6_3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( X1 = X2
| s__instance(X3,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_14,plain,
( s__part(X2,X1)
| ~ s__instance(X1,s__Substance)
| ~ s__instance(X2,s__Substance)
| ~ s__piece(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
s__piece(s__Object6_1,s__Object6_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_16,plain,
s__instance(s__Object6_1,s__Substance),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_17,plain,
s__instance(s__Object6_2,s__Substance),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_18,plain,
! [X6434,X6435] :
( ~ s__instance(X6434,s__SetOrClass)
| ~ s__instance(X6434,s__NullSet)
| ~ s__instance(X6435,X6434) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])]) ).
cnf(c_0_19,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__part(s__Object6_1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
s__part(s__Object6_1,s__Object6_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_24,plain,
( s__instance(esk160_3(X1,X2,X3),X2)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,plain,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,esk160_3(X2,s__NullSet,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( esk160_3(X1,s__NullSet,X2) = s__UnionFn(X3,X4)
| s__UnionFn(X2,X1) = s__NullSet ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_27,plain,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,s__UnionFn(X4,X5)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( s__instance(esk159_3(X1,X2,X3),X1)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| s__UnionFn(X5,X6) = s__NullSet ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( s__UnionFn(X1,X2) = s__UnionFn(X3,X4)
| s__UnionFn(X5,X6) = s__NullSet ),
inference(spm,[status(thm)],[c_0_26,c_0_26]) ).
cnf(c_0_31,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| s__NullSet != X1 ),
inference(ef,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
( s__UnionFn(X1,X2) = s__NullSet
| s__UnionFn(X3,X4) != s__NullSet ),
inference(ef,[status(thm)],[c_0_30]) ).
cnf(c_0_33,plain,
s__UnionFn(X1,s__UnionFn(X2,X3)) = s__NullSet,
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_34,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,esk159_3(s__NullSet,X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_35,plain,
s__UnionFn(X1,X2) = s__NullSet,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( X1 = s__NullSet
| ~ s__instance(X2,esk159_3(s__NullSet,X1,X3)) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( X1 = s__NullSet
| s__instance(esk159_3(X2,X1,X3),X2) ),
inference(rw,[status(thm)],[c_0_28,c_0_35]) ).
cnf(c_0_38,plain,
X1 = s__NullSet,
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_39,plain,
X1 = X2,
inference(spm,[status(thm)],[c_0_38,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
~ s__part(s__Object6_1,X1),
inference(spm,[status(thm)],[c_0_12,c_0_39]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CSR080+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 : Fri Jun 10 21:39:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.41/0.61 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.61 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.61 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.61 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 25.03/5.59 # ENIGMATIC: Solved by autoschedule:
% 25.03/5.59 # No SInE strategy applied
% 25.03/5.59 # Trying AutoSched0 for 150 seconds
% 25.03/5.59 # AutoSched0-Mode selected heuristic G_E___107_C18_F1_AE_Q4_CS_SP_CO_S0Y
% 25.03/5.59 # and selection function SelectMaxLComplexAvoidPosPred.
% 25.03/5.59 #
% 25.03/5.59 # Preprocessing time : 0.572 s
% 25.03/5.59
% 25.03/5.59 # Proof found!
% 25.03/5.59 # SZS status Theorem
% 25.03/5.59 # SZS output start CNFRefutation
% See solution above
% 25.03/5.59 # Training examples: 0 positive, 0 negative
% 25.03/5.59
% 25.03/5.59 # -------------------------------------------------
% 25.03/5.59 # User time : 1.641 s
% 25.03/5.59 # System time : 0.075 s
% 25.03/5.59 # Total time : 1.716 s
% 25.03/5.59 # Maximum resident set size: 10056 pages
% 25.03/5.59
%------------------------------------------------------------------------------