TSTP Solution File: PUZ130+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ130+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n004.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:42 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 29
% Syntax : Number of formulae : 51 ( 20 unt; 18 typ; 0 def)
% Number of atoms : 63 ( 6 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 53 ( 23 ~; 21 |; 3 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 9 >; 3 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
cat: $i > $o ).
tff(decl_23,type,
garfield: $i ).
tff(decl_24,type,
dog: $i > $o ).
tff(decl_25,type,
odie: $i ).
tff(decl_26,type,
pet: $i > $o ).
tff(decl_27,type,
human: $i > $o ).
tff(decl_28,type,
jon: $i ).
tff(decl_29,type,
owner_of: $i > $i ).
tff(decl_30,type,
owner: ( $i * $i ) > $o ).
tff(decl_31,type,
chased: ( $i * $i ) > $o ).
tff(decl_32,type,
hates: ( $i * $i ) > $o ).
tff(decl_33,type,
esk1_0: $i ).
tff(decl_34,type,
esk2_0: $i ).
tff(decl_35,type,
esk3_0: $i ).
tff(decl_36,type,
esk4_0: $i ).
tff(decl_37,type,
esk5_1: $i > $i ).
tff(decl_38,type,
esk6_0: $i ).
tff(decl_39,type,
esk7_0: $i ).
fof(dog_pet_type,axiom,
! [X1] :
( dog(X1)
=> pet(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dog_pet_type) ).
fof(owner_def,axiom,
! [X2,X3] :
( ( human(X2)
& pet(X3) )
=> ( owner(X2,X3)
<=> X2 = owner_of(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owner_def) ).
fof(odie_type,axiom,
dog(odie),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_type) ).
fof(cat_pet_type,axiom,
! [X1] :
( cat(X1)
=> pet(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cat_pet_type) ).
fof(cat_chase_axiom,axiom,
! [X2,X3] :
( ( cat(X2)
& dog(X3) )
=> ( chased(X3,X2)
=> hates(owner_of(X2),owner_of(X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cat_chase_axiom) ).
fof(jon_o_owner_axiom,axiom,
owner(jon,odie),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_o_owner_axiom) ).
fof(jon_type,axiom,
human(jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_type) ).
fof(garfield_type,axiom,
cat(garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',garfield_type) ).
fof(jon_g_owner_axiom,axiom,
owner(jon,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_g_owner_axiom) ).
fof(jon_conjecture,conjecture,
hates(jon,jon),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',jon_conjecture) ).
fof(odie_chase_axiom,axiom,
chased(odie,garfield),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odie_chase_axiom) ).
fof(c_0_11,plain,
! [X7] :
( ~ dog(X7)
| pet(X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dog_pet_type])]) ).
fof(c_0_12,plain,
! [X19,X20] :
( ( ~ owner(X19,X20)
| X19 = owner_of(X20)
| ~ human(X19)
| ~ pet(X20) )
& ( X19 != owner_of(X20)
| owner(X19,X20)
| ~ human(X19)
| ~ pet(X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owner_def])])]) ).
cnf(c_0_13,plain,
( pet(X1)
| ~ dog(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
dog(odie),
inference(split_conjunct,[status(thm)],[odie_type]) ).
fof(c_0_15,plain,
! [X8] :
( ~ cat(X8)
| pet(X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cat_pet_type])]) ).
fof(c_0_16,plain,
! [X17,X18] :
( ~ cat(X17)
| ~ dog(X18)
| ~ chased(X18,X17)
| hates(owner_of(X17),owner_of(X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cat_chase_axiom])]) ).
cnf(c_0_17,plain,
( X1 = owner_of(X2)
| ~ owner(X1,X2)
| ~ human(X1)
| ~ pet(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
owner(jon,odie),
inference(split_conjunct,[status(thm)],[jon_o_owner_axiom]) ).
cnf(c_0_19,plain,
human(jon),
inference(split_conjunct,[status(thm)],[jon_type]) ).
cnf(c_0_20,plain,
pet(odie),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( pet(X1)
| ~ cat(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
cat(garfield),
inference(split_conjunct,[status(thm)],[garfield_type]) ).
cnf(c_0_23,plain,
( hates(owner_of(X1),owner_of(X2))
| ~ cat(X1)
| ~ dog(X2)
| ~ chased(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
owner_of(odie) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
owner(jon,garfield),
inference(split_conjunct,[status(thm)],[jon_g_owner_axiom]) ).
cnf(c_0_26,plain,
pet(garfield),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_27,negated_conjecture,
~ hates(jon,jon),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[jon_conjecture])]) ).
cnf(c_0_28,plain,
( hates(owner_of(X1),jon)
| ~ chased(odie,X1)
| ~ cat(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14])]) ).
cnf(c_0_29,plain,
owner_of(garfield) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_19]),c_0_26])]) ).
cnf(c_0_30,plain,
chased(odie,garfield),
inference(split_conjunct,[status(thm)],[odie_chase_axiom]) ).
cnf(c_0_31,negated_conjecture,
~ hates(jon,jon),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_22])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ130+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 22:14:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.61 % Total time : 0.012000 s
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time : 0.015000 s
%------------------------------------------------------------------------------