%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV385+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 : Wed Jul 20 17:47:03 EDT 2022
% Result : Theorem 7.70s 2.30s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jt4zesxe/lgb.p',i_0_48) ).
cnf(i_0_45,negated_conjecture,
ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jt4zesxe/lgb.p',i_0_45) ).
cnf(i_0_47,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
| ~ ok(triple(esk1_0,esk2_0,esk3_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jt4zesxe/lgb.p',i_0_47) ).
cnf(i_0_49,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jt4zesxe/lgb.p',i_0_49) ).
cnf(i_0_46,negated_conjecture,
check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jt4zesxe/lgb.p',i_0_46) ).
cnf(c_0_55,lemma,
( ok(triple(X1,X2,X3))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
i_0_48 ).
cnf(c_0_56,negated_conjecture,
ok(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
i_0_45 ).
cnf(c_0_57,negated_conjecture,
( ~ check_cpq(triple(esk1_0,esk2_0,esk3_0))
| ~ ok(triple(esk1_0,esk2_0,esk3_0)) ),
i_0_47 ).
cnf(c_0_58,negated_conjecture,
ok(triple(esk1_0,esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
i_0_49 ).
cnf(c_0_60,negated_conjecture,
check_cpq(im_succ_cpq(triple(esk1_0,esk2_0,esk3_0))),
i_0_46 ).
cnf(c_0_61,negated_conjecture,
~ check_cpq(triple(esk1_0,esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_56])]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV385+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n005.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 : Tue Jun 14 18:52:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/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
% 7.70/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.70/2.30 # No SInE strategy applied
% 7.70/2.30 # Trying AutoSched0 for 150 seconds
% 7.70/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S03DN
% 7.70/2.30 # and selection function PSelectComplexExceptRRHorn.
% 7.70/2.30 #
% 7.70/2.30 # Preprocessing time : 0.012 s
% 7.70/2.30 # Presaturation interreduction done
% 7.70/2.30
% 7.70/2.30 # Proof found!
% 7.70/2.30 # SZS status Theorem
% 7.70/2.30 # SZS output start CNFRefutation
% See solution above
% 7.70/2.30 # Training examples: 0 positive, 0 negative
% 7.70/2.30
% 7.70/2.30 # -------------------------------------------------
% 7.70/2.30 # User time : 0.013 s
% 7.70/2.30 # System time : 0.005 s
% 7.70/2.30 # Total time : 0.018 s
% 7.70/2.30 # Maximum resident set size: 7124 pages
% 7.70/2.30
%------------------------------------------------------------------------------