TSTP Solution File: ALG199+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:57 EDT 2022
% Result : Theorem 8.50s 2.55s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 25 ( 23 unt; 2 nHn; 25 RR)
% Number of literals : 37 ( 36 equ; 14 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_513,plain,
op(e5,op(e5,e5)) = e4,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_513) ).
cnf(i_0_516,plain,
op(e5,e5) = e1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_516) ).
cnf(i_0_515,plain,
op(op(e5,op(e5,e5)),op(e5,op(e5,e5))) = e2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_515) ).
cnf(i_0_519,negated_conjecture,
( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_519) ).
cnf(i_0_502,plain,
e1 != e5,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_502) ).
cnf(i_0_525,negated_conjecture,
op(e1,e1) != e1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_525) ).
cnf(i_0_499,plain,
e2 != e4,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_499) ).
cnf(i_0_526,negated_conjecture,
op(e0,e0) != e0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_526) ).
cnf(i_0_524,negated_conjecture,
op(e2,e2) != e2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_524) ).
cnf(i_0_523,negated_conjecture,
op(e3,e3) != e3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_523) ).
cnf(i_0_520,negated_conjecture,
op(e6,e6) != e6,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uw9nwk1l/lgb.p',i_0_520) ).
cnf(c_0_538,plain,
op(e5,op(e5,e5)) = e4,
i_0_513 ).
cnf(c_0_539,plain,
op(e5,e5) = e1,
i_0_516 ).
cnf(c_0_540,plain,
op(op(e5,op(e5,e5)),op(e5,op(e5,e5))) = e2,
i_0_515 ).
cnf(c_0_541,plain,
op(e5,e1) = e4,
inference(rw,[status(thm)],[c_0_538,c_0_539]) ).
cnf(c_0_542,negated_conjecture,
( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 ),
i_0_519 ).
cnf(c_0_543,plain,
op(e4,e4) = e2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_540,c_0_539]),c_0_541]),c_0_539]),c_0_541]) ).
cnf(c_0_544,plain,
e1 != e5,
i_0_502 ).
cnf(c_0_545,negated_conjecture,
op(e1,e1) != e1,
i_0_525 ).
cnf(c_0_546,plain,
e2 != e4,
i_0_499 ).
cnf(c_0_547,negated_conjecture,
op(e0,e0) != e0,
i_0_526 ).
cnf(c_0_548,negated_conjecture,
op(e2,e2) != e2,
i_0_524 ).
cnf(c_0_549,negated_conjecture,
op(e3,e3) != e3,
i_0_523 ).
cnf(c_0_550,negated_conjecture,
op(e6,e6) != e6,
i_0_520 ).
cnf(c_0_551,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_542,c_0_539]),c_0_543]),c_0_544]),c_0_545]),c_0_546]),c_0_547]),c_0_548]),c_0_549]),c_0_550]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 8 00:47:21 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.50/2.55 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.50/2.55 # No SInE strategy applied
% 8.50/2.55 # Trying AutoSched0 for 150 seconds
% 8.50/2.55 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.50/2.55 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.50/2.55 #
% 8.50/2.55 # Preprocessing time : 0.023 s
% 8.50/2.55 # Presaturation interreduction done
% 8.50/2.55
% 8.50/2.55 # Proof found!
% 8.50/2.55 # SZS status Theorem
% 8.50/2.55 # SZS output start CNFRefutation
% See solution above
% 8.50/2.55 # Training examples: 0 positive, 0 negative
% 8.50/2.55
% 8.50/2.55 # -------------------------------------------------
% 8.50/2.55 # User time : 0.021 s
% 8.50/2.55 # System time : 0.008 s
% 8.50/2.55 # Total time : 0.029 s
% 8.50/2.55 # Maximum resident set size: 7120 pages
% 8.50/2.55
%------------------------------------------------------------------------------