TSTP Solution File: CSR081+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR081+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:35 EDT 2022
% Result : Theorem 29.99s 6.40s
% Output : CNFRefutation 29.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 115 ( 35 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 130 ( 50 ~; 57 |; 18 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 88 ( 50 sgn 18 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
( s__mother(s__Bill7_1,s__Jane7_1)
& s__mother(s__Bob7_1,s__Jane7_1) ),
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(local_4,axiom,
s__mother(s__Bill7_1,s__Jane7_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
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_4,negated_conjecture,
~ ( s__mother(s__Bill7_1,s__Jane7_1)
& s__mother(s__Bob7_1,s__Jane7_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_5,negated_conjecture,
( ~ s__mother(s__Bill7_1,s__Jane7_1)
| ~ s__mother(s__Bob7_1,s__Jane7_1) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_6,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])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ s__mother(s__Bill7_1,s__Jane7_1)
| ~ s__mother(s__Bob7_1,s__Jane7_1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
s__mother(s__Bill7_1,s__Jane7_1),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_9,plain,
( s__instance(X1,s__SetOrClass)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ s__mother(s__Bob7_1,s__Jane7_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,plain,
( X1 = X2
| s__instance(X3,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
fof(c_0_12,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_13,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__mother(X2,s__Jane7_1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_16,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_17,plain,
( s__instance(esk160_3(X1,X2,X3),X2)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,esk160_3(X2,s__NullSet,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( esk160_3(X1,s__NullSet,X2) = s__UnionFn(X3,X4)
| s__UnionFn(X2,X1) = s__NullSet ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_20,plain,
( s__UnionFn(X1,X2) = s__NullSet
| ~ s__instance(X3,s__UnionFn(X4,X5)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( s__instance(esk159_3(X1,X2,X3),X1)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| s__UnionFn(X5,X6) = s__NullSet ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( s__UnionFn(X1,X2) = s__UnionFn(X3,X4)
| s__UnionFn(X5,X6) = s__NullSet ),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_24,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| s__NullSet != X1 ),
inference(ef,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
( s__UnionFn(X1,X2) = s__NullSet
| s__UnionFn(X3,X4) != s__NullSet ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
s__UnionFn(X1,s__UnionFn(X2,X3)) = s__NullSet,
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
( X1 = s__UnionFn(X2,s__NullSet)
| ~ s__instance(X3,esk159_3(s__NullSet,X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_28,plain,
s__UnionFn(X1,X2) = s__NullSet,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( X1 = s__NullSet
| ~ s__instance(X2,esk159_3(s__NullSet,X1,X3)) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( X1 = s__NullSet
| s__instance(esk159_3(X2,X1,X3),X2) ),
inference(rw,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_31,plain,
X1 = s__NullSet,
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_32,plain,
X1 = X2,
inference(spm,[status(thm)],[c_0_31,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
~ s__mother(X1,s__Jane7_1),
inference(spm,[status(thm)],[c_0_10,c_0_32]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[c_0_8,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : CSR081+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 9 21:30:55 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.50/0.68 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.50/0.68 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.50/0.68 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.50/0.68 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 29.99/6.40 # ENIGMATIC: Solved by autoschedule:
% 29.99/6.40 # No SInE strategy applied
% 29.99/6.40 # Trying AutoSched0 for 150 seconds
% 29.99/6.40 # AutoSched0-Mode selected heuristic G_E___107_C18_F1_AE_Q4_CS_SP_CO_S0Y
% 29.99/6.40 # and selection function SelectMaxLComplexAvoidPosPred.
% 29.99/6.40 #
% 29.99/6.40 # Preprocessing time : 0.609 s
% 29.99/6.40
% 29.99/6.40 # Proof found!
% 29.99/6.40 # SZS status Theorem
% 29.99/6.40 # SZS output start CNFRefutation
% See solution above
% 29.99/6.40 # Training examples: 0 positive, 0 negative
% 29.99/6.40
% 29.99/6.40 # -------------------------------------------------
% 29.99/6.40 # User time : 2.540 s
% 29.99/6.40 # System time : 0.125 s
% 29.99/6.40 # Total time : 2.665 s
% 29.99/6.40 # Maximum resident set size: 10056 pages
% 29.99/6.40
%------------------------------------------------------------------------------