TSTP Solution File: ITP006+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ITP006+1 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 22:34:00 EDT 2022
% Result : Theorem 264.82s 34.68s
% Output : CNFRefutation 264.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 11 unt; 7 nHn; 16 RR)
% Number of literals : 35 ( 8 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_244,negated_conjecture,
( p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk17_0),s(esk14_0,X1))))
| ~ p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk18_0),s(esk14_0,X1)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_244) ).
cnf(i_0_97,plain,
( p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4))))
| p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4),s(X2,app_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(X1,esk9_4(X1,X2,X3,X4))))))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_97) ).
cnf(i_0_98,plain,
( ~ p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4))))
| ~ p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4),s(X2,app_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(X1,X5)))))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_98) ).
cnf(i_0_242,negated_conjecture,
~ p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(esk15_0,esk14_0),esk16_0),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk18_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_242) ).
cnf(i_0_69,plain,
( s(tyop_2Emin_2Ebool,X1) = s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0)
| p(s(tyop_2Emin_2Ebool,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_69) ).
cnf(i_0_243,negated_conjecture,
p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(esk15_0,esk14_0),esk16_0),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk17_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_243) ).
cnf(i_0_6,plain,
( s(tyop_2Emin_2Ebool,X1) = s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0)
| s(tyop_2Emin_2Ebool,X1) = s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_6) ).
cnf(i_0_5,plain,
~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_5) ).
cnf(i_0_4,plain,
p(s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2nu16abt/input.p',i_0_4) ).
cnf(c_0_254,negated_conjecture,
( p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk17_0),s(esk14_0,X1))))
| ~ p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk18_0),s(esk14_0,X1)))) ),
i_0_244 ).
cnf(c_0_255,plain,
( p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4))))
| p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4),s(X2,app_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(X1,esk9_4(X1,X2,X3,X4))))))) ),
i_0_97 ).
cnf(c_0_256,plain,
( ~ p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4))))
| ~ p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X4),s(X2,app_2E2(s(tyop_2Emin_2Efun(X1,X2),X3),s(X1,X5)))))) ),
i_0_98 ).
cnf(c_0_257,negated_conjecture,
( p(s(tyop_2Emin_2Ebool,app_2E2(s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk17_0),s(esk14_0,app_2E2(s(tyop_2Emin_2Efun(X1,esk14_0),X2),s(X1,esk9_4(X1,esk14_0,X2,esk18_0)))))))
| p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(X1,esk14_0),X2),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk18_0)))) ),
inference(spm,[status(thm)],[c_0_254,c_0_255]) ).
cnf(c_0_258,negated_conjecture,
~ p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(esk15_0,esk14_0),esk16_0),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk18_0)))),
i_0_242 ).
cnf(c_0_259,plain,
( s(tyop_2Emin_2Ebool,X1) = s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0)
| p(s(tyop_2Emin_2Ebool,X1)) ),
i_0_69 ).
cnf(c_0_260,negated_conjecture,
p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(esk15_0,esk14_0),esk16_0),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk17_0)))),
i_0_243 ).
cnf(c_0_261,plain,
( s(tyop_2Emin_2Ebool,X1) = s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0)
| s(tyop_2Emin_2Ebool,X1) = s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0) ),
i_0_6 ).
cnf(c_0_262,plain,
~ p(s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0)),
i_0_5 ).
cnf(c_0_263,plain,
( p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(X1,esk14_0),X2),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk18_0))))
| ~ p(s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(X1,esk14_0),X2),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk17_0)))) ),
inference(spm,[status(thm)],[c_0_256,c_0_257]) ).
cnf(c_0_264,negated_conjecture,
s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(esk15_0,esk14_0),esk16_0),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk18_0))) = s(tyop_2Emin_2Ebool,c_2Ebool_2EF_2E0),
inference(spm,[status(thm)],[c_0_258,c_0_259]) ).
cnf(c_0_265,plain,
s(tyop_2Emin_2Ebool,c_2EquantHeuristics_2EGUESS__FORALL__POINT_2E2(s(tyop_2Emin_2Efun(esk15_0,esk14_0),esk16_0),s(tyop_2Emin_2Efun(esk14_0,tyop_2Emin_2Ebool),esk17_0))) = s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_260,c_0_261]),c_0_262]) ).
cnf(c_0_266,plain,
p(s(tyop_2Emin_2Ebool,c_2Ebool_2ET_2E0)),
i_0_4 ).
cnf(c_0_267,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_264]),c_0_265]),c_0_266])]),c_0_262]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP006+1 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 3 18:05:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 264.82/34.68 # ENIGMATIC: Solved by autoschedule:
% 264.82/34.68 # No SInE strategy applied
% 264.82/34.68 # Trying AutoSched0 for 150 seconds
% 264.82/34.68 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SP_PI_S0Y
% 264.82/34.68 # and selection function SelectMaxLComplexAvoidPosPred.
% 264.82/34.68 #
% 264.82/34.68 # Preprocessing time : 0.027 s
% 264.82/34.68
% 264.82/34.68 # Proof found!
% 264.82/34.68 # SZS status Theorem
% 264.82/34.68 # SZS output start CNFRefutation
% See solution above
% 264.82/34.68 # Training examples: 0 positive, 0 negative
% 264.82/34.68
% 264.82/34.68 # -------------------------------------------------
% 264.82/34.68 # User time : 31.271 s
% 264.82/34.68 # System time : 0.707 s
% 264.82/34.68 # Total time : 31.978 s
% 264.82/34.68 # Maximum resident set size: 7124 pages
% 264.82/34.68
%------------------------------------------------------------------------------