TSTP Solution File: PUZ061+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 18:07:56 EDT 2022
% Result : Theorem 6.82s 2.16s
% Output : CNFRefutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 9 unt; 0 nHn; 19 RR)
% Number of literals : 44 ( 0 equ; 26 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-6 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 75 ( 55 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( likes(X1,X2)
| ~ food(X2)
| ~ epred1_6(X3,X4,X5,X6,X1,X7) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vrr0sh1w/lgb.p',i_0_10) ).
cnf(i_0_2,negated_conjecture,
epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vrr0sh1w/lgb.p',i_0_2) ).
cnf(i_0_7,plain,
( food(X1)
| ~ eats(X2,X1)
| ~ not_killed_by(X2,X1)
| ~ epred1_6(X3,X4,X5,X6,X7,X8) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vrr0sh1w/lgb.p',i_0_7) ).
cnf(i_0_6,plain,
( eats(X1,X2)
| ~ epred1_6(X3,X4,X5,X1,X6,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vrr0sh1w/lgb.p',i_0_6) ).
cnf(i_0_1,negated_conjecture,
~ likes(esk2_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vrr0sh1w/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
( not_killed_by(X1,X2)
| ~ alive(X1)
| ~ epred1_6(X3,X4,X5,X6,X7,X8) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vrr0sh1w/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
( alive(X1)
| ~ epred1_6(X2,X3,X4,X1,X5,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vrr0sh1w/lgb.p',i_0_5) ).
cnf(c_0_18,plain,
( likes(X1,X2)
| ~ food(X2)
| ~ epred1_6(X3,X4,X5,X6,X1,X7) ),
i_0_10 ).
cnf(c_0_19,negated_conjecture,
epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0),
i_0_2 ).
cnf(c_0_20,plain,
( food(X1)
| ~ eats(X2,X1)
| ~ not_killed_by(X2,X1)
| ~ epred1_6(X3,X4,X5,X6,X7,X8) ),
i_0_7 ).
cnf(c_0_21,plain,
( eats(X1,X2)
| ~ epred1_6(X3,X4,X5,X1,X6,X2) ),
i_0_6 ).
cnf(c_0_22,negated_conjecture,
~ likes(esk2_0,esk1_0),
i_0_1 ).
cnf(c_0_23,negated_conjecture,
( likes(esk2_0,X1)
| ~ food(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( food(X1)
| ~ eats(X2,X1)
| ~ not_killed_by(X2,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
eats(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
~ food(esk1_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( not_killed_by(X1,X2)
| ~ alive(X1)
| ~ epred1_6(X3,X4,X5,X6,X7,X8) ),
i_0_3 ).
cnf(c_0_28,plain,
( alive(X1)
| ~ epred1_6(X2,X3,X4,X1,X5,X6) ),
i_0_5 ).
cnf(c_0_29,negated_conjecture,
~ not_killed_by(esk3_0,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( not_killed_by(X1,X2)
| ~ alive(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_31,negated_conjecture,
alive(esk3_0),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sat May 28 21:28:12 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.36 # ENIGMATIC: Selected complete mode:
% 6.82/2.16 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.82/2.16 # No SInE strategy applied
% 6.82/2.16 # Trying AutoSched0 for 150 seconds
% 6.82/2.16 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 6.82/2.16 # and selection function PSelectComplexExceptRRHorn.
% 6.82/2.16 #
% 6.82/2.16 # Preprocessing time : 0.012 s
% 6.82/2.16
% 6.82/2.16 # Proof found!
% 6.82/2.16 # SZS status Theorem
% 6.82/2.16 # SZS output start CNFRefutation
% See solution above
% 6.82/2.16 # Training examples: 0 positive, 0 negative
% 6.82/2.16
% 6.82/2.16 # -------------------------------------------------
% 6.82/2.16 # User time : 0.013 s
% 6.82/2.16 # System time : 0.003 s
% 6.82/2.16 # Total time : 0.015 s
% 6.82/2.16 # Maximum resident set size: 7124 pages
% 6.82/2.16
%------------------------------------------------------------------------------