TSTP Solution File: PUZ060+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ060+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 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 : 300s
% DateTime : Thu Aug 31 13:12:26 EDT 2023
% Result : Theorem 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 23 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 60 ( 15 ~; 11 |; 24 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 37 ( 1 sgn; 28 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
food: $i > $o ).
tff(decl_23,type,
likes: ( $i * $i ) > $o ).
tff(decl_24,type,
eats: ( $i * $i ) > $o ).
tff(decl_25,type,
not_killed_by: ( $i * $i ) > $o ).
tff(decl_26,type,
alive: $i > $o ).
tff(decl_27,type,
esk1_0: $i ).
tff(decl_28,type,
esk2_0: $i ).
tff(decl_29,type,
esk3_0: $i ).
tff(decl_30,type,
esk4_0: $i ).
tff(decl_31,type,
esk5_0: $i ).
tff(decl_32,type,
esk6_0: $i ).
fof(prove_this,conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ( ! [X7] :
( food(X7)
=> likes(X2,X7) )
& food(X5)
& food(X6)
& ! [X7] :
( ? [X8] :
( eats(X8,X7)
& not_killed_by(X8,X7) )
=> food(X7) )
& eats(X3,X1)
& alive(X3)
& ! [X7] :
( eats(X3,X7)
=> eats(X4,X7) )
& ! [X8] :
( alive(X8)
=> ! [X7] : not_killed_by(X8,X7) ) )
=> likes(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6] :
( ( ! [X7] :
( food(X7)
=> likes(X2,X7) )
& food(X5)
& food(X6)
& ! [X7] :
( ? [X8] :
( eats(X8,X7)
& not_killed_by(X8,X7) )
=> food(X7) )
& eats(X3,X1)
& alive(X3)
& ! [X7] :
( eats(X3,X7)
=> eats(X4,X7) )
& ! [X8] :
( alive(X8)
=> ! [X7] : not_killed_by(X8,X7) ) )
=> likes(X2,X1) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_2,negated_conjecture,
! [X15,X16,X17,X18,X19,X20] :
( ( ~ food(X15)
| likes(esk2_0,X15) )
& food(esk5_0)
& food(esk6_0)
& ( ~ eats(X17,X16)
| ~ not_killed_by(X17,X16)
| food(X16) )
& eats(esk3_0,esk1_0)
& alive(esk3_0)
& ( ~ eats(esk3_0,X18)
| eats(esk4_0,X18) )
& ( ~ alive(X19)
| not_killed_by(X19,X20) )
& ~ likes(esk2_0,esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( food(X2)
| ~ eats(X1,X2)
| ~ not_killed_by(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( not_killed_by(X1,X2)
| ~ alive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ likes(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( likes(esk2_0,X1)
| ~ food(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( food(X1)
| ~ alive(X2)
| ~ eats(X2,X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_8,negated_conjecture,
eats(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
alive(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
~ food(esk1_0),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ060+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 22:42:45 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.59 start to proof: theBenchmark
% 0.19/0.61 % Version : CSE_E---1.5
% 0.19/0.61 % Problem : theBenchmark.p
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark.p
% 0.19/0.61 % SZS output start Proof
% See solution above
% 0.19/0.61 % Total time : 0.004000 s
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time : 0.006000 s
%------------------------------------------------------------------------------