TSTP Solution File: GEO531+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO531+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:46:08 EDT 2022
% Result : Theorem 13.24s 3.23s
% Output : CNFRefutation 13.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 14 unt; 0 def)
% Number of atoms : 194 ( 72 equ)
% Maximal formula atoms : 42 ( 4 avg)
% Number of connectives : 220 ( 65 ~; 135 |; 20 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-6 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-6 aty)
% Number of variables : 117 ( 0 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz11_6,conjecture,
! [X12,X15,X14] :
( X12 = X15
| X14 = X15
| congruent(X12,X15,X14,X12,X15,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz11_6) ).
fof(aSatz11_4b,axiom,
! [X12,X15,X14,X17,X18,X19] :
( ( X12 = X15
| X14 = X15
| X17 = X18
| X19 = X18
| sameside(f113a(X12,X15,X14,X17,X18,X19),X15,X12)
| congruent(X12,X15,X14,X17,X18,X19) )
& ( X12 = X15
| X14 = X15
| X17 = X18
| X19 = X18
| sameside(f113c(X12,X15,X14,X17,X18,X19),X15,X14)
| congruent(X12,X15,X14,X17,X18,X19) )
& ( X12 = X15
| X14 = X15
| X17 = X18
| X19 = X18
| sameside(f113d(X12,X15,X14,X17,X18,X19),X18,X17)
| congruent(X12,X15,X14,X17,X18,X19) )
& ( X12 = X15
| X14 = X15
| X17 = X18
| X19 = X18
| sameside(f113f(X12,X15,X14,X17,X18,X19),X18,X19)
| congruent(X12,X15,X14,X17,X18,X19) )
& ( X12 = X15
| X14 = X15
| X17 = X18
| X19 = X18
| s_e(X15,f113a(X12,X15,X14,X17,X18,X19),X18,f113d(X12,X15,X14,X17,X18,X19))
| congruent(X12,X15,X14,X17,X18,X19) )
& ( X12 = X15
| X14 = X15
| X17 = X18
| X19 = X18
| s_e(X15,f113c(X12,X15,X14,X17,X18,X19),X18,f113f(X12,X15,X14,X17,X18,X19))
| congruent(X12,X15,X14,X17,X18,X19) )
& ( X12 = X15
| X14 = X15
| X17 = X18
| X19 = X18
| ~ s_e(f113a(X12,X15,X14,X17,X18,X19),f113c(X12,X15,X14,X17,X18,X19),f113d(X12,X15,X14,X17,X18,X19),f113f(X12,X15,X14,X17,X18,X19))
| congruent(X12,X15,X14,X17,X18,X19) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz11_4b) ).
fof(aSatz6_7,axiom,
! [X12,X13,X15,X14] :
( ~ sameside(X12,X13,X15)
| ~ sameside(X15,X13,X14)
| sameside(X12,X13,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz6_7) ).
fof(aSatz6_6,axiom,
! [X12,X13,X15] :
( ~ sameside(X12,X13,X15)
| sameside(X15,X13,X12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz6_6) ).
fof(aSatz11_3d,axiom,
! [X20,X15,X12,X22,X14,X26,X18,X17,X39,X19] :
( ~ sameside(X20,X15,X12)
| ~ sameside(X22,X15,X14)
| ~ sameside(X26,X18,X17)
| ~ sameside(X39,X18,X19)
| ~ s_e3(X20,X15,X22,X26,X18,X39)
| congruent(X12,X15,X14,X17,X18,X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz11_3d) ).
fof(d_Defn4_4,axiom,
! [X20,X33,X46,X21,X31,X47] :
( ( ~ s_e3(X20,X33,X46,X21,X31,X47)
| s_e(X20,X33,X21,X31) )
& ( ~ s_e3(X20,X33,X46,X21,X31,X47)
| s_e(X20,X46,X21,X47) )
& ( ~ s_e3(X20,X33,X46,X21,X31,X47)
| s_e(X33,X46,X31,X47) )
& ( ~ s_e(X20,X33,X21,X31)
| ~ s_e(X20,X46,X21,X47)
| ~ s_e(X33,X46,X31,X47)
| s_e3(X20,X33,X46,X21,X31,X47) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_Defn4_4) ).
fof(aSatz2_1,axiom,
! [X12,X15] : s_e(X12,X15,X12,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz2_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X12,X15,X14] :
( X12 = X15
| X14 = X15
| congruent(X12,X15,X14,X12,X15,X14) ),
inference(assume_negation,[status(cth)],[aSatz11_6]) ).
fof(c_0_8,negated_conjecture,
( esk1_0 != esk2_0
& esk3_0 != esk2_0
& ~ congruent(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X903,X904,X905,X906,X907,X908] :
( ( X903 = X904
| X905 = X904
| X906 = X907
| X908 = X907
| sameside(f113a(X903,X904,X905,X906,X907,X908),X904,X903)
| congruent(X903,X904,X905,X906,X907,X908) )
& ( X903 = X904
| X905 = X904
| X906 = X907
| X908 = X907
| sameside(f113c(X903,X904,X905,X906,X907,X908),X904,X905)
| congruent(X903,X904,X905,X906,X907,X908) )
& ( X903 = X904
| X905 = X904
| X906 = X907
| X908 = X907
| sameside(f113d(X903,X904,X905,X906,X907,X908),X907,X906)
| congruent(X903,X904,X905,X906,X907,X908) )
& ( X903 = X904
| X905 = X904
| X906 = X907
| X908 = X907
| sameside(f113f(X903,X904,X905,X906,X907,X908),X907,X908)
| congruent(X903,X904,X905,X906,X907,X908) )
& ( X903 = X904
| X905 = X904
| X906 = X907
| X908 = X907
| s_e(X904,f113a(X903,X904,X905,X906,X907,X908),X907,f113d(X903,X904,X905,X906,X907,X908))
| congruent(X903,X904,X905,X906,X907,X908) )
& ( X903 = X904
| X905 = X904
| X906 = X907
| X908 = X907
| s_e(X904,f113c(X903,X904,X905,X906,X907,X908),X907,f113f(X903,X904,X905,X906,X907,X908))
| congruent(X903,X904,X905,X906,X907,X908) )
& ( X903 = X904
| X905 = X904
| X906 = X907
| X908 = X907
| ~ s_e(f113a(X903,X904,X905,X906,X907,X908),f113c(X903,X904,X905,X906,X907,X908),f113d(X903,X904,X905,X906,X907,X908),f113f(X903,X904,X905,X906,X907,X908))
| congruent(X903,X904,X905,X906,X907,X908) ) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz11_4b])]) ).
fof(c_0_10,plain,
! [X333,X334,X335,X336] :
( ~ sameside(X333,X334,X335)
| ~ sameside(X335,X334,X336)
| sameside(X333,X334,X336) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz6_7])]) ).
cnf(c_0_11,negated_conjecture,
~ congruent(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X1 = X2
| X3 = X2
| X4 = X5
| X6 = X5
| sameside(f113c(X1,X2,X3,X4,X5,X6),X2,X3)
| congruent(X1,X2,X3,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
esk3_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X330,X331,X332] :
( ~ sameside(X330,X331,X332)
| sameside(X332,X331,X330) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz6_6])]) ).
fof(c_0_16,plain,
! [X893,X894,X895,X896,X897,X898,X899,X900,X901,X902] :
( ~ sameside(X893,X894,X895)
| ~ sameside(X896,X894,X897)
| ~ sameside(X898,X899,X900)
| ~ sameside(X901,X899,X902)
| ~ s_e3(X893,X894,X896,X898,X899,X901)
| congruent(X895,X894,X897,X900,X899,X902) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz11_3d])]) ).
cnf(c_0_17,plain,
( sameside(X1,X2,X4)
| ~ sameside(X1,X2,X3)
| ~ sameside(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
sameside(f113c(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0),esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
( sameside(X3,X2,X1)
| ~ sameside(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( X1 = X2
| X3 = X2
| X4 = X5
| X6 = X5
| sameside(f113a(X1,X2,X3,X4,X5,X6),X2,X1)
| congruent(X1,X2,X3,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( congruent(X3,X2,X5,X8,X7,X10)
| ~ sameside(X1,X2,X3)
| ~ sameside(X4,X2,X5)
| ~ sameside(X6,X7,X8)
| ~ sameside(X9,X7,X10)
| ~ s_e3(X1,X2,X4,X6,X7,X9) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( sameside(X1,esk2_0,esk3_0)
| ~ sameside(X1,esk2_0,f113c(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
sameside(esk3_0,esk2_0,f113c(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
sameside(f113a(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0),esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_20]),c_0_13]),c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( ~ sameside(X1,esk2_0,esk3_0)
| ~ sameside(X2,esk2_0,esk1_0)
| ~ sameside(X3,esk2_0,esk3_0)
| ~ sameside(X4,esk2_0,esk1_0)
| ~ s_e3(X4,esk2_0,X3,X2,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
sameside(esk3_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( sameside(X1,esk2_0,esk1_0)
| ~ sameside(X1,esk2_0,f113a(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
sameside(esk1_0,esk2_0,f113a(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( ~ sameside(X1,esk2_0,esk1_0)
| ~ sameside(X2,esk2_0,esk3_0)
| ~ sameside(X3,esk2_0,esk1_0)
| ~ s_e3(X3,esk2_0,X2,X1,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
sameside(esk1_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( ~ sameside(X1,esk2_0,esk3_0)
| ~ sameside(X2,esk2_0,esk1_0)
| ~ s_e3(X2,esk2_0,X1,esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( ~ sameside(X1,esk2_0,esk1_0)
| ~ s_e3(X1,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
fof(c_0_33,plain,
! [X956,X957,X958,X959,X960,X961] :
( ( ~ s_e3(X956,X957,X958,X959,X960,X961)
| s_e(X956,X957,X959,X960) )
& ( ~ s_e3(X956,X957,X958,X959,X960,X961)
| s_e(X956,X958,X959,X961) )
& ( ~ s_e3(X956,X957,X958,X959,X960,X961)
| s_e(X957,X958,X960,X961) )
& ( ~ s_e(X956,X957,X959,X960)
| ~ s_e(X956,X958,X959,X961)
| ~ s_e(X957,X958,X960,X961)
| s_e3(X956,X957,X958,X959,X960,X961) ) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[d_Defn4_4])]) ).
fof(c_0_34,plain,
! [X81,X82] : s_e(X81,X82,X81,X82),
inference(variable_rename,[status(thm)],[aSatz2_1]) ).
cnf(c_0_35,negated_conjecture,
~ s_e3(esk1_0,esk2_0,esk3_0,esk1_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_36,plain,
( s_e3(X1,X2,X5,X3,X4,X6)
| ~ s_e(X1,X2,X3,X4)
| ~ s_e(X1,X5,X3,X6)
| ~ s_e(X2,X5,X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
s_e(X1,X2,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_37]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO531+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 06:04:39 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.24/3.23 # ENIGMATIC: Solved by autoschedule:
% 13.24/3.23 # No SInE strategy applied
% 13.24/3.23 # Trying AutoSched0 for 150 seconds
% 13.24/3.23 # AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S070I
% 13.24/3.23 # and selection function SelectVGNonCR.
% 13.24/3.23 #
% 13.24/3.23 # Preprocessing time : 0.047 s
% 13.24/3.23 # Presaturation interreduction done
% 13.24/3.23
% 13.24/3.23 # Proof found!
% 13.24/3.23 # SZS status Theorem
% 13.24/3.23 # SZS output start CNFRefutation
% See solution above
% 13.24/3.23 # Training examples: 0 positive, 0 negative
% 13.24/3.23
% 13.24/3.23 # -------------------------------------------------
% 13.24/3.23 # User time : 0.743 s
% 13.24/3.23 # System time : 0.029 s
% 13.24/3.23 # Total time : 0.772 s
% 13.24/3.23 # Maximum resident set size: 7124 pages
% 13.24/3.23
%------------------------------------------------------------------------------