TSTP Solution File: GEO084+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO084+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Sat Jul 16 03:43:13 EDT 2022
% Result : Theorem 11.58s 2.86s
% Output : CNFRefutation 11.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 7 unt; 0 def)
% Number of atoms : 111 ( 14 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 109 ( 36 ~; 53 |; 14 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 82 ( 6 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(corollary_2_6_2,conjecture,
! [X2,X4,X6,X3] :
( ( part_of(X2,X6)
& part_of(X4,X6)
& meet(X3,X2,X4) )
=> part_of(sum(X2,X4),X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_2_6_2) ).
fof(sum_defn,axiom,
! [X1,X2,X4] :
( X1 = sum(X2,X4)
<=> ! [X5] :
( incident_c(X5,X1)
<=> ( incident_c(X5,X2)
| incident_c(X5,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',sum_defn) ).
fof(part_of_defn,axiom,
! [X1,X2] :
( part_of(X2,X1)
<=> ! [X3] :
( incident_c(X3,X2)
=> incident_c(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',part_of_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X2,X4,X6,X3] :
( ( part_of(X2,X6)
& part_of(X4,X6)
& meet(X3,X2,X4) )
=> part_of(sum(X2,X4),X6) ),
inference(assume_negation,[status(cth)],[corollary_2_6_2]) ).
fof(c_0_4,plain,
! [X14,X15,X16,X17,X18,X19,X20,X21] :
( ( ~ incident_c(X17,X14)
| incident_c(X17,X15)
| incident_c(X17,X16)
| X14 != sum(X15,X16) )
& ( ~ incident_c(X18,X15)
| incident_c(X18,X14)
| X14 != sum(X15,X16) )
& ( ~ incident_c(X18,X16)
| incident_c(X18,X14)
| X14 != sum(X15,X16) )
& ( ~ incident_c(esk2_3(X19,X20,X21),X20)
| ~ incident_c(esk2_3(X19,X20,X21),X19)
| X19 = sum(X20,X21) )
& ( ~ incident_c(esk2_3(X19,X20,X21),X21)
| ~ incident_c(esk2_3(X19,X20,X21),X19)
| X19 = sum(X20,X21) )
& ( incident_c(esk2_3(X19,X20,X21),X19)
| incident_c(esk2_3(X19,X20,X21),X20)
| incident_c(esk2_3(X19,X20,X21),X21)
| X19 = sum(X20,X21) ) ),
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)],[sum_defn])])])])])]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X11,X12] :
( ( ~ part_of(X9,X8)
| ~ incident_c(X10,X9)
| incident_c(X10,X8) )
& ( incident_c(esk1_2(X11,X12),X12)
| part_of(X12,X11) )
& ( ~ incident_c(esk1_2(X11,X12),X11)
| part_of(X12,X11) ) ),
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)],[part_of_defn])])])])])]) ).
fof(c_0_6,negated_conjecture,
( part_of(esk14_0,esk16_0)
& part_of(esk15_0,esk16_0)
& meet(esk17_0,esk14_0,esk15_0)
& ~ part_of(sum(esk14_0,esk15_0),esk16_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( incident_c(X1,X3)
| ~ incident_c(X1,X2)
| X3 != sum(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( incident_c(X3,X2)
| ~ part_of(X1,X2)
| ~ incident_c(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
part_of(esk15_0,esk16_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
part_of(esk14_0,esk16_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( part_of(X2,X1)
| ~ incident_c(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( incident_c(X1,sum(X2,X3))
| ~ incident_c(X1,X2) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( incident_c(X1,esk16_0)
| ~ incident_c(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( incident_c(esk1_2(X1,X2),X2)
| part_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( incident_c(X1,esk16_0)
| ~ incident_c(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_16,plain,
( part_of(X1,sum(X2,X3))
| ~ incident_c(esk1_2(sum(X2,X3),X1),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( incident_c(esk1_2(X1,esk15_0),esk16_0)
| part_of(esk15_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( incident_c(esk2_3(X1,X2,X3),X1)
| incident_c(esk2_3(X1,X2,X3),X2)
| incident_c(esk2_3(X1,X2,X3),X3)
| X1 = sum(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( incident_c(esk1_2(X1,esk14_0),esk16_0)
| part_of(esk14_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
part_of(esk15_0,sum(esk16_0,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( sum(X1,X2) = X1
| incident_c(esk2_3(X1,X1,X2),X2)
| incident_c(esk2_3(X1,X1,X2),X1) ),
inference(ef,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
part_of(esk14_0,sum(esk16_0,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( incident_c(X1,sum(esk16_0,X2))
| ~ incident_c(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_24,plain,
( X1 = sum(X2,X3)
| ~ incident_c(esk2_3(X1,X2,X3),X2)
| ~ incident_c(esk2_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_25,plain,
( sum(X1,X1) = X1
| incident_c(esk2_3(X1,X1,X1),X1) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( incident_c(X1,X3)
| incident_c(X1,X4)
| ~ incident_c(X1,X2)
| X2 != sum(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,negated_conjecture,
( incident_c(X1,sum(esk16_0,X2))
| ~ incident_c(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( part_of(X1,sum(esk16_0,X2))
| ~ incident_c(esk1_2(sum(esk16_0,X2),X1),esk15_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_29,plain,
sum(X1,X1) = X1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_30,plain,
( incident_c(X1,X2)
| incident_c(X1,X3)
| ~ incident_c(X1,sum(X3,X2)) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( part_of(X1,sum(esk16_0,X2))
| ~ incident_c(esk1_2(sum(esk16_0,X2),X1),esk14_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( part_of(X1,esk16_0)
| ~ incident_c(esk1_2(esk16_0,X1),esk15_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( incident_c(esk1_2(X1,sum(X2,X3)),X2)
| incident_c(esk1_2(X1,sum(X2,X3)),X3)
| part_of(sum(X2,X3),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_14]) ).
cnf(c_0_34,negated_conjecture,
( part_of(X1,esk16_0)
| ~ incident_c(esk1_2(esk16_0,X1),esk14_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( incident_c(esk1_2(esk16_0,sum(X1,esk15_0)),X1)
| part_of(sum(X1,esk15_0),esk16_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
~ part_of(sum(esk14_0,esk15_0),esk16_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO084+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 03:58:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.58/2.86 # ENIGMATIC: Solved by autoschedule:
% 11.58/2.86 # No SInE strategy applied
% 11.58/2.86 # Trying AutoSched0 for 150 seconds
% 11.58/2.86 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 11.58/2.86 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.58/2.86 #
% 11.58/2.86 # Preprocessing time : 0.027 s
% 11.58/2.86
% 11.58/2.86 # Proof found!
% 11.58/2.86 # SZS status Theorem
% 11.58/2.86 # SZS output start CNFRefutation
% See solution above
% 11.58/2.86 # Training examples: 0 positive, 0 negative
% 11.58/2.86
% 11.58/2.86 # -------------------------------------------------
% 11.58/2.86 # User time : 0.385 s
% 11.58/2.86 # System time : 0.021 s
% 11.58/2.86 # Total time : 0.406 s
% 11.58/2.86 # Maximum resident set size: 7124 pages
% 11.58/2.86
%------------------------------------------------------------------------------