TSTP Solution File: PUZ129+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n001.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.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 55 ( 7 unt; 19 typ; 0 def)
% Number of atoms : 248 ( 49 equ)
% Maximal formula atoms : 58 ( 6 avg)
% Number of connectives : 321 ( 109 ~; 91 |; 88 &)
% ( 1 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 10 >; 2 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 94 ( 0 sgn; 41 !; 29 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
person: $i > $o ).
tff(decl_23,type,
honest: $i ).
tff(decl_24,type,
pos: $i ).
tff(decl_25,type,
property1: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
industrious: $i ).
tff(decl_27,type,
healthy: $i ).
tff(decl_28,type,
grocer: $i > $o ).
tff(decl_29,type,
cyclist: $i > $o ).
tff(decl_30,type,
unhealthy: $i ).
tff(decl_31,type,
dishonest: $i ).
tff(decl_32,type,
epred1_0: $o ).
tff(decl_33,type,
esk1_0: $i ).
tff(decl_34,type,
esk2_0: $i ).
tff(decl_35,type,
esk3_1: $i > $i ).
tff(decl_36,type,
esk4_1: $i > $i ).
tff(decl_37,type,
esk5_1: $i > $i ).
tff(decl_38,type,
esk6_1: $i > $i ).
tff(decl_39,type,
esk7_1: $i > $i ).
tff(decl_40,type,
esk8_1: $i > $i ).
fof(prove,conjecture,
( ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]),c_0_1]) ).
fof(c_0_4,plain,
! [X23,X25,X26,X27,X29,X31,X33,X34,X35,X36,X37,X39] :
( ( property1(esk3_1(X23),healthy,pos)
| ~ person(X23)
| ~ property1(X23,honest,pos)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( X23 = esk3_1(X23)
| ~ person(X23)
| ~ property1(X23,honest,pos)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( ~ grocer(X25)
| ~ property1(X26,healthy,pos)
| X25 != X26
| ~ epred1_0 )
& ( property1(esk4_1(X27),honest,pos)
| ~ grocer(X27)
| ~ property1(X27,industrious,pos)
| ~ epred1_0 )
& ( X27 = esk4_1(X27)
| ~ grocer(X27)
| ~ property1(X27,industrious,pos)
| ~ epred1_0 )
& ( property1(esk5_1(X29),industrious,pos)
| ~ cyclist(X29)
| ~ epred1_0 )
& ( X29 = esk5_1(X29)
| ~ cyclist(X29)
| ~ epred1_0 )
& ( property1(esk6_1(X31),dishonest,pos)
| ~ cyclist(X31)
| ~ property1(X31,unhealthy,pos)
| ~ epred1_0 )
& ( X31 = esk6_1(X31)
| ~ cyclist(X31)
| ~ property1(X31,unhealthy,pos)
| ~ epred1_0 )
& ( ~ person(X33)
| ~ property1(X33,healthy,pos)
| ~ property1(X34,unhealthy,pos)
| X33 != X34
| ~ epred1_0 )
& ( ~ person(X35)
| ~ property1(X35,honest,pos)
| ~ property1(X36,dishonest,pos)
| X35 != X36
| ~ epred1_0 )
& ( person(esk7_1(X37))
| ~ grocer(X37)
| ~ epred1_0 )
& ( X37 = esk7_1(X37)
| ~ grocer(X37)
| ~ epred1_0 )
& ( person(esk8_1(X39))
| ~ cyclist(X39)
| ~ epred1_0 )
& ( X39 = esk8_1(X39)
| ~ cyclist(X39)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_0
& grocer(esk1_0)
& cyclist(esk2_0)
& esk1_0 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X1 = esk3_1(X1)
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( person(esk7_1(X1))
| ~ grocer(X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( X1 = esk7_1(X1)
| ~ grocer(X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( property1(esk4_1(X1),honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( X1 = esk4_1(X1)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ cyclist(X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( X1 = esk5_1(X1)
| ~ cyclist(X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ person(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_16,plain,
( esk3_1(X1) = X1
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ person(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_17,plain,
( person(esk7_1(X1))
| ~ grocer(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7])]) ).
cnf(c_0_18,plain,
( esk7_1(X1) = X1
| ~ grocer(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).
cnf(c_0_19,plain,
( property1(esk4_1(X1),honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_20,plain,
( esk4_1(X1) = X1
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_7])]) ).
cnf(c_0_21,plain,
( ~ grocer(X1)
| ~ property1(X2,healthy,pos)
| X1 != X2
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_7])]) ).
cnf(c_0_23,plain,
( esk5_1(X1) = X1
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7])]) ).
cnf(c_0_24,negated_conjecture,
cyclist(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( property1(X1,healthy,pos)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ person(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_27,plain,
( person(X1)
| ~ grocer(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_28,plain,
( property1(X1,honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( ~ grocer(X1)
| ~ property1(X1,healthy,pos) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_7])])]) ).
cnf(c_0_30,plain,
( property1(X1,industrious,pos)
| ~ cyclist(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
cyclist(esk1_0),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
grocer(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_34,negated_conjecture,
property1(esk1_0,industrious,pos),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.34 % Computer : n001.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sat Aug 26 22:40:46 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.52 start to proof: theBenchmark
% 0.20/0.53 % Version : CSE_E---1.5
% 0.20/0.53 % Problem : theBenchmark.p
% 0.20/0.53 % Proof found
% 0.20/0.53 % SZS status Theorem for theBenchmark.p
% 0.20/0.53 % SZS output start Proof
% See solution above
% 0.20/0.54 % Total time : 0.007000 s
% 0.20/0.54 % SZS output end Proof
% 0.20/0.54 % Total time : 0.009000 s
%------------------------------------------------------------------------------