TSTP Solution File: PUZ129+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n007.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 : Tue Aug 22 10:54:15 EDT 2023
% Result : Theorem 3.44s 1.77s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 47 ( 12 unt; 18 typ; 0 def)
% Number of atoms : 92 ( 21 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 99 ( 36 ~; 28 |; 24 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 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 : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 30 (; 20 !; 10 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ property1 > person > grocer > cyclist > #nlpp > unhealthy > pos > industrious > honest > healthy > dishonest > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_7 > #skF_8 > #skF_3 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(honest,type,
honest: $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(grocer,type,
grocer: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(healthy,type,
healthy: $i ).
tff(pos,type,
pos: $i ).
tff(industrious,type,
industrious: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(property1,type,
property1: ( $i * $i * $i ) > $o ).
tff(unhealthy,type,
unhealthy: $i ).
tff(dishonest,type,
dishonest: $i ).
tff(person,type,
person: $i > $o ).
tff(cyclist,type,
cyclist: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_126,negated_conjecture,
~ ( ( ! [A] :
( ( person(A)
& property1(A,honest,pos)
& property1(A,industrious,pos) )
=> ? [B] :
( property1(B,healthy,pos)
& ( A = B ) ) )
& ! [C] :
( grocer(C)
=> ~ ? [D] :
( property1(D,healthy,pos)
& ( C = D ) ) )
& ! [E] :
( ( grocer(E)
& property1(E,industrious,pos) )
=> ? [F] :
( property1(F,honest,pos)
& ( E = F ) ) )
& ! [G] :
( cyclist(G)
=> ? [H] :
( property1(H,industrious,pos)
& ( G = H ) ) )
& ! [I] :
( ( cyclist(I)
& property1(I,unhealthy,pos) )
=> ? [J] :
( property1(J,dishonest,pos)
& ( I = J ) ) )
& ! [K] :
( ( person(K)
& property1(K,healthy,pos) )
=> ~ ? [L] :
( property1(L,unhealthy,pos)
& ( K = L ) ) )
& ! [M] :
( ( person(M)
& property1(M,honest,pos) )
=> ~ ? [N] :
( property1(N,dishonest,pos)
& ( M = N ) ) )
& ! [O] :
( grocer(O)
=> ? [P] :
( person(P)
& ( O = P ) ) )
& ! [Q] :
( cyclist(Q)
=> ? [R] :
( person(R)
& ( Q = R ) ) ) )
=> ! [S] :
( grocer(S)
=> ~ ? [T] :
( cyclist(T)
& ( S = T ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
tff(c_2,plain,
'#skF_7' = '#skF_8',
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_6,plain,
grocer('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_37,plain,
grocer('#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_6]) ).
tff(c_42,plain,
! [O_23] :
( ( '#skF_5'(O_23) = O_23 )
| ~ grocer(O_23) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_46,plain,
'#skF_5'('#skF_8') = '#skF_8',
inference(resolution,[status(thm)],[c_37,c_42]) ).
tff(c_51,plain,
! [O_24] :
( person('#skF_5'(O_24))
| ~ grocer(O_24) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_54,plain,
( person('#skF_8')
| ~ grocer('#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_46,c_51]) ).
tff(c_56,plain,
person('#skF_8'),
inference(demodulation,[status(thm),theory(equality)],[c_37,c_54]) ).
tff(c_4,plain,
cyclist('#skF_8'),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_57,plain,
! [G_25] :
( ( '#skF_3'(G_25) = G_25 )
| ~ cyclist(G_25) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_61,plain,
'#skF_3'('#skF_8') = '#skF_8',
inference(resolution,[status(thm)],[c_4,c_57]) ).
tff(c_82,plain,
! [G_29] :
( property1('#skF_3'(G_29),industrious,pos)
| ~ cyclist(G_29) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_85,plain,
( property1('#skF_8',industrious,pos)
| ~ cyclist('#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_61,c_82]) ).
tff(c_87,plain,
property1('#skF_8',industrious,pos),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_85]) ).
tff(c_88,plain,
! [E_30] :
( ( '#skF_2'(E_30) = E_30 )
| ~ property1(E_30,industrious,pos)
| ~ grocer(E_30) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_91,plain,
( ( '#skF_2'('#skF_8') = '#skF_8' )
| ~ grocer('#skF_8') ),
inference(resolution,[status(thm)],[c_87,c_88]) ).
tff(c_97,plain,
'#skF_2'('#skF_8') = '#skF_8',
inference(demodulation,[status(thm),theory(equality)],[c_37,c_91]) ).
tff(c_113,plain,
! [E_36] :
( property1('#skF_2'(E_36),honest,pos)
| ~ property1(E_36,industrious,pos)
| ~ grocer(E_36) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_119,plain,
( property1('#skF_8',honest,pos)
| ~ property1('#skF_8',industrious,pos)
| ~ grocer('#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_97,c_113]) ).
tff(c_122,plain,
property1('#skF_8',honest,pos),
inference(demodulation,[status(thm),theory(equality)],[c_37,c_87,c_119]) ).
tff(c_129,plain,
! [A_37] :
( ( '#skF_1'(A_37) = A_37 )
| ~ property1(A_37,industrious,pos)
| ~ property1(A_37,honest,pos)
| ~ person(A_37) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_132,plain,
( ( '#skF_1'('#skF_8') = '#skF_8' )
| ~ property1('#skF_8',honest,pos)
| ~ person('#skF_8') ),
inference(resolution,[status(thm)],[c_87,c_129]) ).
tff(c_138,plain,
'#skF_1'('#skF_8') = '#skF_8',
inference(demodulation,[status(thm),theory(equality)],[c_56,c_122,c_132]) ).
tff(c_150,plain,
! [A_39] :
( property1('#skF_1'(A_39),healthy,pos)
| ~ property1(A_39,industrious,pos)
| ~ property1(A_39,honest,pos)
| ~ person(A_39) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_12,plain,
! [D_5] :
( ~ property1(D_5,healthy,pos)
| ~ grocer(D_5) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_160,plain,
! [A_40] :
( ~ grocer('#skF_1'(A_40))
| ~ property1(A_40,industrious,pos)
| ~ property1(A_40,honest,pos)
| ~ person(A_40) ),
inference(resolution,[status(thm)],[c_150,c_12]) ).
tff(c_163,plain,
( ~ grocer('#skF_8')
| ~ property1('#skF_8',industrious,pos)
| ~ property1('#skF_8',honest,pos)
| ~ person('#skF_8') ),
inference(superposition,[status(thm),theory(equality)],[c_138,c_160]) ).
tff(c_166,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_122,c_87,c_37,c_163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n007.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 : Thu Aug 3 17:23:08 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.44/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.44/1.78
% 3.44/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.44/1.81
% 3.44/1.81 Inference rules
% 3.44/1.81 ----------------------
% 3.44/1.81 #Ref : 0
% 3.44/1.81 #Sup : 30
% 3.44/1.81 #Fact : 0
% 3.44/1.81 #Define : 0
% 3.44/1.81 #Split : 0
% 3.44/1.81 #Chain : 0
% 3.44/1.81 #Close : 0
% 3.44/1.81
% 3.44/1.81 Ordering : KBO
% 3.44/1.81
% 3.44/1.81 Simplification rules
% 3.44/1.81 ----------------------
% 3.44/1.81 #Subsume : 1
% 3.44/1.81 #Demod : 27
% 3.44/1.81 #Tautology : 14
% 3.44/1.81 #SimpNegUnit : 0
% 3.44/1.81 #BackRed : 0
% 3.44/1.81
% 3.44/1.81 #Partial instantiations: 0
% 3.44/1.81 #Strategies tried : 1
% 3.44/1.81
% 3.44/1.81 Timing (in seconds)
% 3.44/1.81 ----------------------
% 3.44/1.81 Preprocessing : 0.50
% 3.44/1.81 Parsing : 0.26
% 3.44/1.81 CNF conversion : 0.04
% 3.44/1.81 Main loop : 0.24
% 3.44/1.81 Inferencing : 0.09
% 3.44/1.81 Reduction : 0.07
% 3.44/1.81 Demodulation : 0.05
% 3.44/1.82 BG Simplification : 0.02
% 3.44/1.82 Subsumption : 0.04
% 3.44/1.82 Abstraction : 0.01
% 3.44/1.82 MUC search : 0.00
% 3.44/1.82 Cooper : 0.00
% 3.44/1.82 Total : 0.79
% 3.44/1.82 Index Insertion : 0.00
% 3.44/1.82 Index Deletion : 0.00
% 3.44/1.82 Index Matching : 0.00
% 3.44/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------