%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : PHI010+1 : TPTP v9.0.0. Released v7.2.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 : n029.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 : Wed Apr 9 08:22:25 PM UTC 2025
% Result : Theorem 2.87s 1.63s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 41 ( 8 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 40 ( 14 ~; 11 |; 9 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 12 ( 11 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_the > exemplifies_property > property > object > #nlpp > #skF_1 > #skF_5 > #skF_2 > #skF_3 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(object,type,
object: $i > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(property,type,
property: $i > $o ).
tff(is_the,type,
is_the: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(exemplifies_property,type,
exemplifies_property: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_79,negated_conjecture,
~ ! [X,F,Y] :
( ( object(X)
& property(F)
& object(Y) )
=> ( ( is_the(X,F)
& ( X = Y ) )
=> exemplifies_property(F,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1) ).
tff(f_66,axiom,
! [F,X,W] :
( ( property(F)
& object(X)
& object(W) )
=> ( ( is_the(X,F)
& ( X = W ) )
<=> ? [Y] :
( object(Y)
& exemplifies_property(F,Y)
& ! [Z] :
( object(Z)
=> ( exemplifies_property(F,Z)
=> ( Z = Y ) ) )
& ( Y = W ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_identity_instance) ).
tff(c_34,plain,
'#skF_5' = '#skF_3',
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_32,plain,
~ exemplifies_property('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_45,plain,
~ exemplifies_property('#skF_4','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32]) ).
tff(c_40,plain,
property('#skF_4'),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_42,plain,
object('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_36,plain,
is_the('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_69,plain,
! [F_28,X_29] :
( ( '#skF_1'(F_28,X_29,X_29) = X_29 )
| ~ is_the(X_29,F_28)
| ~ object(X_29)
| ~ property(F_28) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_71,plain,
( ( '#skF_1'('#skF_4','#skF_3','#skF_3') = '#skF_3' )
| ~ object('#skF_3')
| ~ property('#skF_4') ),
inference(resolution,[status(thm)],[c_36,c_69]) ).
tff(c_74,plain,
'#skF_1'('#skF_4','#skF_3','#skF_3') = '#skF_3',
inference(demodulation,[status(thm),theory(equality)],[c_40,c_42,c_71]) ).
tff(c_85,plain,
! [F_32,X_33] :
( exemplifies_property(F_32,'#skF_1'(F_32,X_33,X_33))
| ~ is_the(X_33,F_32)
| ~ object(X_33)
| ~ property(F_32) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_94,plain,
( exemplifies_property('#skF_4','#skF_3')
| ~ is_the('#skF_3','#skF_4')
| ~ object('#skF_3')
| ~ property('#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_74,c_85]) ).
tff(c_98,plain,
exemplifies_property('#skF_4','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_42,c_36,c_94]) ).
tff(c_100,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_45,c_98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : PHI010+1 : TPTP v9.0.0. Released v7.2.0.
% 0.13/0.13 % 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.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 8 16:27:49 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.87/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.95/1.64
% 2.95/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------