TSTP Solution File: ALG174+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG174+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:42 EDT 2022
% Result : Theorem 7.21s 2.26s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 11 RR)
% Number of literals : 11 ( 10 equ; 3 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_221,negated_conjecture,
op(op(e3,e3),e3) = e3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tjlrp2y7/lgb.p',i_0_221) ).
cnf(i_0_212,plain,
op(e3,e3) = e2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tjlrp2y7/lgb.p',i_0_212) ).
cnf(i_0_123,plain,
op(e2,e2) != op(e2,e3),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tjlrp2y7/lgb.p',i_0_123) ).
cnf(i_0_82,plain,
op(op(e3,e3),op(e3,e3)) = e3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tjlrp2y7/lgb.p',i_0_82) ).
cnf(c_0_226,negated_conjecture,
op(op(e3,e3),e3) = e3,
i_0_221 ).
cnf(c_0_227,plain,
op(e3,e3) = e2,
i_0_212 ).
cnf(c_0_228,plain,
op(e2,e2) != op(e2,e3),
i_0_123 ).
cnf(c_0_229,negated_conjecture,
op(e2,e3) = e3,
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_230,plain,
op(op(e3,e3),op(e3,e3)) = e3,
i_0_82 ).
cnf(c_0_231,plain,
op(e2,e2) != e3,
inference(rw,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_232,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_227]),c_0_227]),c_0_231]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ALG174+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/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 02:13:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.21/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.21/2.26 # No SInE strategy applied
% 7.21/2.26 # Trying AutoSched0 for 150 seconds
% 7.21/2.26 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.21/2.26 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.21/2.26 #
% 7.21/2.26 # Preprocessing time : 0.014 s
% 7.21/2.26 # Presaturation interreduction done
% 7.21/2.26
% 7.21/2.26 # Proof found!
% 7.21/2.26 # SZS status Theorem
% 7.21/2.26 # SZS output start CNFRefutation
% See solution above
% 7.21/2.26 # Training examples: 0 positive, 0 negative
% 7.21/2.26
% 7.21/2.26 # -------------------------------------------------
% 7.21/2.26 # User time : 0.015 s
% 7.21/2.26 # System time : 0.003 s
% 7.21/2.26 # Total time : 0.018 s
% 7.21/2.26 # Maximum resident set size: 7128 pages
% 7.21/2.26
%------------------------------------------------------------------------------