TSTP Solution File: NUN067+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN067+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Mon Jul 18 16:24:54 EDT 2022
% Result : Theorem 7.38s 2.39s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 7 RR)
% Number of literals : 25 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-2 aty)
% Number of variables : 29 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_52,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ky9rshr8/lgb.p',i_0_52) ).
cnf(i_0_60,negated_conjecture,
id(X1,esk21_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ky9rshr8/lgb.p',i_0_60) ).
cnf(i_0_59,negated_conjecture,
r1(esk21_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ky9rshr8/lgb.p',i_0_59) ).
cnf(i_0_49,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ky9rshr8/lgb.p',i_0_49) ).
cnf(i_0_10,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ky9rshr8/lgb.p',i_0_10) ).
cnf(i_0_13,plain,
id(esk2_2(X1,X2),esk1_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ky9rshr8/lgb.p',i_0_13) ).
cnf(c_0_67,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
i_0_52 ).
cnf(c_0_68,negated_conjecture,
id(X1,esk21_1(X1)),
i_0_60 ).
cnf(c_0_69,negated_conjecture,
r1(esk21_1(X1)),
i_0_59 ).
cnf(c_0_70,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
i_0_49 ).
cnf(c_0_71,negated_conjecture,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_72,plain,
( ~ r2(X1,X2)
| ~ id(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_73,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
i_0_10 ).
cnf(c_0_74,plain,
id(esk2_2(X1,X2),esk1_2(X1,X2)),
i_0_13 ).
cnf(c_0_75,plain,
~ id(X1,esk1_2(X2,X3)),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,plain,
$false,
inference(sr,[status(thm)],[c_0_74,c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUN067+1 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 2 08:10:25 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.38/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.38/2.39 # No SInE strategy applied
% 7.38/2.39 # Trying AutoSched0 for 150 seconds
% 7.38/2.39 # AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S065A
% 7.38/2.39 # and selection function SelectComplexAHP.
% 7.38/2.39 #
% 7.38/2.39 # Preprocessing time : 0.014 s
% 7.38/2.39 # Presaturation interreduction done
% 7.38/2.39
% 7.38/2.39 # Proof found!
% 7.38/2.39 # SZS status Theorem
% 7.38/2.39 # SZS output start CNFRefutation
% See solution above
% 7.38/2.39 # Training examples: 0 positive, 0 negative
% 7.38/2.39
% 7.38/2.39 # -------------------------------------------------
% 7.38/2.39 # User time : 0.017 s
% 7.38/2.39 # System time : 0.003 s
% 7.38/2.39 # Total time : 0.020 s
% 7.38/2.39 # Maximum resident set size: 7120 pages
% 7.38/2.39
%------------------------------------------------------------------------------