TSTP Solution File: COM129+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM129+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : Fri Jul 15 01:07:23 EDT 2022
% Result : Theorem 7.83s 2.56s
% Output : CNFRefutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 8 unt; 0 nHn; 14 RR)
% Number of literals : 32 ( 12 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_39,plain,
( vgensym(X1) != X2
| ~ visFreeVar(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tqs2blkz/lgb.p',i_0_39) ).
cnf(i_0_37,negated_conjecture,
vgensym(vapp(vapp(esk1_0,esk4_0),vvar(esk2_0))) = esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tqs2blkz/lgb.p',i_0_37) ).
cnf(i_0_49,plain,
( visFreeVar(X1,X2)
| X3 != X1
| X2 != vapp(X4,X5)
| ~ visFreeVar(X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tqs2blkz/lgb.p',i_0_49) ).
cnf(i_0_48,plain,
( visFreeVar(X1,X2)
| X3 != X1
| X2 != vapp(X4,X5)
| ~ visFreeVar(X3,X5) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tqs2blkz/lgb.p',i_0_48) ).
cnf(i_0_36,negated_conjecture,
visFreeVar(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tqs2blkz/lgb.p',i_0_36) ).
cnf(c_0_55,plain,
( vgensym(X1) != X2
| ~ visFreeVar(X2,X1) ),
i_0_39 ).
cnf(c_0_56,plain,
~ visFreeVar(vgensym(X1),X1),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_57,negated_conjecture,
vgensym(vapp(vapp(esk1_0,esk4_0),vvar(esk2_0))) = esk3_0,
i_0_37 ).
cnf(c_0_58,plain,
( visFreeVar(X1,X2)
| X3 != X1
| X2 != vapp(X4,X5)
| ~ visFreeVar(X3,X4) ),
i_0_49 ).
cnf(c_0_59,negated_conjecture,
~ visFreeVar(esk3_0,vapp(vapp(esk1_0,esk4_0),vvar(esk2_0))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_58])]) ).
cnf(c_0_61,plain,
( visFreeVar(X1,X2)
| X3 != X1
| X2 != vapp(X4,X5)
| ~ visFreeVar(X3,X5) ),
i_0_48 ).
cnf(c_0_62,negated_conjecture,
~ visFreeVar(esk3_0,vapp(esk1_0,esk4_0)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_61])]) ).
cnf(c_0_64,negated_conjecture,
visFreeVar(esk3_0,esk4_0),
i_0_36 ).
cnf(c_0_65,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COM129+1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 17:46:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.83/2.56 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.83/2.56 # No SInE strategy applied
% 7.83/2.56 # Trying AutoSched0 for 150 seconds
% 7.83/2.56 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.83/2.56 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.83/2.56 #
% 7.83/2.56 # Preprocessing time : 0.023 s
% 7.83/2.56 # Presaturation interreduction done
% 7.83/2.56
% 7.83/2.56 # Proof found!
% 7.83/2.56 # SZS status Theorem
% 7.83/2.56 # SZS output start CNFRefutation
% See solution above
% 7.83/2.56 # Training examples: 0 positive, 0 negative
% 7.83/2.56
% 7.83/2.56 # -------------------------------------------------
% 7.83/2.56 # User time : 0.023 s
% 7.83/2.56 # System time : 0.007 s
% 7.83/2.56 # Total time : 0.031 s
% 7.83/2.56 # Maximum resident set size: 7120 pages
% 7.83/2.56
%------------------------------------------------------------------------------