TSTP Solution File: GEO497+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO497+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:00 EDT 2022
% Result : Theorem 7.35s 2.16s
% Output : CNFRefutation 7.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 109 ( 50 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 124 ( 57 ~; 55 |; 12 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 98 ( 4 sgn 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz6_11a,conjecture,
! [X27,X12,X15,X14] :
( ( X27 = X12
| X15 = X14
| sameside(insert(X15,X14,X12,X27),X12,X27) )
& ( X27 = X12
| X15 = X14
| s_e(X12,insert(X15,X14,X12,X27),X15,X14) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz6_11a) ).
fof(d_insert,axiom,
! [X12,X15,X20,X22] : insert(X12,X15,X20,X22) = ext(ext(X22,X20,alpha,gamma),X20,X12,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_insert) ).
fof(aA4,axiom,
! [X1,X2,X7,X4] :
( s_t(X1,X2,ext(X1,X2,X7,X4))
& s_e(X2,ext(X1,X2,X7,X4),X7,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO011+0.ax',aA4) ).
fof(aSatz6_6,axiom,
! [X12,X13,X15] :
( ~ sameside(X12,X13,X15)
| sameside(X15,X13,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz6_6) ).
fof(aSatz6_2a,axiom,
! [X12,X13,X15,X14] :
( X12 = X13
| X15 = X13
| X14 = X13
| ~ s_t(X12,X13,X14)
| ~ s_t(X15,X13,X14)
| sameside(X12,X13,X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz6_2a) ).
fof(aSatz3_2,axiom,
! [X12,X15,X14] :
( ~ s_t(X12,X15,X14)
| s_t(X14,X15,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz3_2) ).
fof(aSatz3_14b,axiom,
! [X15,X12] : X15 != ext(X12,X15,alpha,gamma),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz3_14b) ).
fof(aA3,axiom,
! [X1,X2,X3] :
( ~ s_e(X1,X2,X3,X3)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO011+0.ax',aA3) ).
fof(aSatz2_2,axiom,
! [X12,X15,X14,X17] :
( ~ s_e(X12,X15,X14,X17)
| s_e(X14,X17,X12,X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz2_2) ).
fof(c_0_9,negated_conjecture,
~ ! [X27,X12,X15,X14] :
( ( X27 = X12
| X15 = X14
| sameside(insert(X15,X14,X12,X27),X12,X27) )
& ( X27 = X12
| X15 = X14
| s_e(X12,insert(X15,X14,X12,X27),X15,X14) ) ),
inference(assume_negation,[status(cth)],[aSatz6_11a]) ).
fof(c_0_10,negated_conjecture,
( ( esk1_0 != esk2_0
| esk1_0 != esk2_0 )
& ( esk3_0 != esk4_0
| esk1_0 != esk2_0 )
& ( ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0)
| esk1_0 != esk2_0 )
& ( esk1_0 != esk2_0
| esk3_0 != esk4_0 )
& ( esk3_0 != esk4_0
| esk3_0 != esk4_0 )
& ( ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0)
| esk3_0 != esk4_0 )
& ( esk1_0 != esk2_0
| ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0) )
& ( esk3_0 != esk4_0
| ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0) )
& ( ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0)
| ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_11,plain,
! [X326,X327,X328,X329] : insert(X326,X327,X328,X329) = ext(ext(X329,X328,alpha,gamma),X328,X326,X327),
inference(variable_rename,[status(thm)],[d_insert]) ).
cnf(c_0_12,negated_conjecture,
( ~ s_e(esk2_0,insert(esk3_0,esk4_0,esk2_0,esk1_0),esk3_0,esk4_0)
| ~ sameside(insert(esk3_0,esk4_0,esk2_0,esk1_0),esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
insert(X1,X2,X3,X4) = ext(ext(X4,X3,alpha,gamma),X3,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X47,X48,X49,X50] :
( s_t(X47,X48,ext(X47,X48,X49,X50))
& s_e(X48,ext(X47,X48,X49,X50),X49,X50) ),
inference(variable_rename,[status(thm)],[aA4]) ).
cnf(c_0_15,negated_conjecture,
( ~ sameside(ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0),esk2_0,esk1_0)
| ~ s_e(esk2_0,ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0),esk3_0,esk4_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
s_e(X1,ext(X2,X1,X3,X4),X3,X4),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X315,X316,X317] :
( ~ sameside(X315,X316,X317)
| sameside(X317,X316,X315) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz6_6])]) ).
cnf(c_0_18,negated_conjecture,
~ sameside(ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0),esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_19,plain,
( sameside(X3,X2,X1)
| ~ sameside(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X292,X293,X294,X295] :
( X292 = X293
| X294 = X293
| X295 = X293
| ~ s_t(X292,X293,X295)
| ~ s_t(X294,X293,X295)
| sameside(X292,X293,X294) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz6_2a])]) ).
cnf(c_0_21,negated_conjecture,
( esk1_0 != esk2_0
| esk1_0 != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
~ sameside(esk1_0,esk2_0,ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( X1 = X2
| X3 = X2
| X4 = X2
| sameside(X1,X2,X3)
| ~ s_t(X1,X2,X4)
| ~ s_t(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
esk2_0 != esk1_0,
inference(cn,[status(thm)],[c_0_21]) ).
fof(c_0_25,plain,
! [X114,X115,X116] :
( ~ s_t(X114,X115,X116)
| s_t(X116,X115,X114) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz3_2])]) ).
cnf(c_0_26,negated_conjecture,
( ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0) = esk2_0
| esk2_0 = X1
| ~ s_t(ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0),esk2_0,X1)
| ~ s_t(esk1_0,esk2_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( s_t(X3,X2,X1)
| ~ s_t(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X148,X149] : X148 != ext(X149,X148,alpha,gamma),
inference(variable_rename,[status(thm)],[aSatz3_14b]) ).
fof(c_0_29,plain,
! [X44,X45,X46] :
( ~ s_e(X44,X45,X46,X46)
| X44 = X45 ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aA3])]) ).
fof(c_0_30,plain,
! [X68,X69,X70,X71] :
( ~ s_e(X68,X69,X70,X71)
| s_e(X70,X71,X68,X69) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[aSatz2_2])]) ).
cnf(c_0_31,negated_conjecture,
( ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0) = esk2_0
| esk2_0 = X1
| ~ s_t(X1,esk2_0,ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0))
| ~ s_t(esk1_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
s_t(X1,X2,ext(X1,X2,X3,X4)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,plain,
X1 != ext(X2,X1,alpha,gamma),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ s_e(X1,X2,X3,X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
( s_e(X3,X4,X1,X2)
| ~ s_e(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
ext(ext(esk1_0,esk2_0,alpha,gamma),esk2_0,esk3_0,esk4_0) = esk2_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_32])]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( esk3_0 != esk4_0
| esk3_0 != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ s_e(X3,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
s_e(esk2_0,esk2_0,esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
esk4_0 != esk3_0,
inference(cn,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GEO497+1 : TPTP v8.1.0. Released v7.0.0.
% 0.02/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sat Jun 18 09:11:33 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.13/0.34 # ENIGMATIC: Selected SinE mode:
% 0.13/0.35 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.35 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.35 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.35/2.16 # ENIGMATIC: Solved by autoschedule:
% 7.35/2.16 # No SInE strategy applied
% 7.35/2.16 # Trying AutoSched0 for 150 seconds
% 7.35/2.16 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S029I
% 7.35/2.16 # and selection function PSelectNonRROptimalLit.
% 7.35/2.16 #
% 7.35/2.16 # Preprocessing time : 0.025 s
% 7.35/2.16 # Presaturation interreduction done
% 7.35/2.16
% 7.35/2.16 # Proof found!
% 7.35/2.16 # SZS status Theorem
% 7.35/2.16 # SZS output start CNFRefutation
% See solution above
% 7.35/2.16 # Training examples: 0 positive, 0 negative
% 7.35/2.16
% 7.35/2.16 # -------------------------------------------------
% 7.35/2.16 # User time : 0.053 s
% 7.35/2.16 # System time : 0.007 s
% 7.35/2.16 # Total time : 0.060 s
% 7.35/2.16 # Maximum resident set size: 7120 pages
% 7.35/2.16
%------------------------------------------------------------------------------