TSTP Solution File: ALG171+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG171+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 : Thu Jul 14 15:32:41 EDT 2022
% Result : Theorem 7.97s 2.43s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 10 RR)
% Number of literals : 10 ( 9 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_215,negated_conjecture,
op(e4,op(e4,e4)) = e4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb_wgpih/lgb.p',i_0_215) ).
cnf(i_0_213,plain,
op(e4,e4) = e1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb_wgpih/lgb.p',i_0_213) ).
cnf(i_0_214,plain,
op(e4,op(e4,e4)) = e0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb_wgpih/lgb.p',i_0_214) ).
cnf(i_0_207,plain,
e0 != e4,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb_wgpih/lgb.p',i_0_207) ).
cnf(c_0_220,negated_conjecture,
op(e4,op(e4,e4)) = e4,
i_0_215 ).
cnf(c_0_221,plain,
op(e4,e4) = e1,
i_0_213 ).
cnf(c_0_222,plain,
op(e4,op(e4,e4)) = e0,
i_0_214 ).
cnf(c_0_223,negated_conjecture,
op(e4,e1) = e4,
inference(rw,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_224,plain,
e0 != e4,
i_0_207 ).
cnf(c_0_225,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_221]),c_0_223]),c_0_224]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG171+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 8 19:06:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.97/2.43 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.97/2.43 # No SInE strategy applied
% 7.97/2.43 # Trying AutoSched0 for 150 seconds
% 7.97/2.43 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.97/2.43 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.97/2.43 #
% 7.97/2.43 # Preprocessing time : 0.024 s
% 7.97/2.43 # Presaturation interreduction done
% 7.97/2.43
% 7.97/2.43 # Proof found!
% 7.97/2.43 # SZS status Theorem
% 7.97/2.43 # SZS output start CNFRefutation
% See solution above
% 7.97/2.43 # Training examples: 0 positive, 0 negative
% 7.97/2.43
% 7.97/2.43 # -------------------------------------------------
% 7.97/2.43 # User time : 0.025 s
% 7.97/2.43 # System time : 0.004 s
% 7.97/2.43 # Total time : 0.029 s
% 7.97/2.43 # Maximum resident set size: 7128 pages
% 7.97/2.43
%------------------------------------------------------------------------------