%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : COM007+2 : TPTP v9.0.0. Released v3.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 : n015.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 05:50:33 PM UTC 2025
% Result : Theorem 3.52s 2.36s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 70 ( 33 ~; 28 |; 4 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 37 ( 36 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rewrite > reflexive_rewrite > #nlpp > goal > c > b > a > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(rewrite,type,
rewrite: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(goal,type,
goal: $o ).
tff(b,type,
b: $i ).
tff(reflexive_rewrite,type,
reflexive_rewrite: ( $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_27,axiom,
( reflexive_rewrite(a,b)
& reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption) ).
tff(f_37,axiom,
! [A,B] :
( ( A = B )
=> reflexive_rewrite(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_in_reflexive_rewrite) ).
tff(f_47,axiom,
! [A,B] :
( reflexive_rewrite(A,B)
=> ( ( A = B )
| rewrite(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_or_rewrite) ).
tff(f_56,axiom,
! [A,B,C] :
( ( rewrite(A,B)
& rewrite(A,C) )
=> ? [D] :
( rewrite(B,D)
& rewrite(C,D) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_diamond) ).
tff(f_41,axiom,
! [A,B] :
( rewrite(A,B)
=> reflexive_rewrite(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_in_reflexive_rewrite) ).
tff(f_58,negated_conjecture,
~ goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
tff(f_33,axiom,
! [A] :
( ( reflexive_rewrite(b,A)
& reflexive_rewrite(c,A) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_ax) ).
tff(c_4,plain,
reflexive_rewrite(a,b),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_8,plain,
! [B_3] : reflexive_rewrite(B_3,B_3),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_2,plain,
reflexive_rewrite(a,c),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_12,plain,
! [A_6,B_7] :
( rewrite(A_6,B_7)
| ( B_7 = A_6 )
| ~ reflexive_rewrite(A_6,B_7) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_38,plain,
! [C_21,A_22,B_23] :
( rewrite(C_21,'#skF_1'(A_22,B_23,C_21))
| ~ rewrite(A_22,C_21)
| ~ rewrite(A_22,B_23) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_10,plain,
! [A_4,B_5] :
( reflexive_rewrite(A_4,B_5)
| ~ rewrite(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_42,plain,
! [C_21,A_22,B_23] :
( reflexive_rewrite(C_21,'#skF_1'(A_22,B_23,C_21))
| ~ rewrite(A_22,C_21)
| ~ rewrite(A_22,B_23) ),
inference(resolution,[status(thm)],[c_38,c_10]) ).
tff(c_33,plain,
! [B_18,A_19,C_20] :
( rewrite(B_18,'#skF_1'(A_19,B_18,C_20))
| ~ rewrite(A_19,C_20)
| ~ rewrite(A_19,B_18) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_43,plain,
! [B_24,A_25,C_26] :
( reflexive_rewrite(B_24,'#skF_1'(A_25,B_24,C_26))
| ~ rewrite(A_25,C_26)
| ~ rewrite(A_25,B_24) ),
inference(resolution,[status(thm)],[c_33,c_10]) ).
tff(c_18,plain,
~ goal,
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_6,plain,
! [A_1] :
( goal
| ~ reflexive_rewrite(c,A_1)
| ~ reflexive_rewrite(b,A_1) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_19,plain,
! [A_1] :
( ~ reflexive_rewrite(c,A_1)
| ~ reflexive_rewrite(b,A_1) ),
inference(negUnitSimplification,[status(thm)],[c_18,c_6]) ).
tff(c_55,plain,
! [A_30,C_31] :
( ~ reflexive_rewrite(b,'#skF_1'(A_30,c,C_31))
| ~ rewrite(A_30,C_31)
| ~ rewrite(A_30,c) ),
inference(resolution,[status(thm)],[c_43,c_19]) ).
tff(c_61,plain,
! [A_32] :
( ~ rewrite(A_32,b)
| ~ rewrite(A_32,c) ),
inference(resolution,[status(thm)],[c_42,c_55]) ).
tff(c_67,plain,
! [A_33] :
( ~ rewrite(A_33,b)
| ( c = A_33 )
| ~ reflexive_rewrite(A_33,c) ),
inference(resolution,[status(thm)],[c_12,c_61]) ).
tff(c_79,plain,
! [A_36] :
( ( c = A_36 )
| ~ reflexive_rewrite(A_36,c)
| ( b = A_36 )
| ~ reflexive_rewrite(A_36,b) ),
inference(resolution,[status(thm)],[c_12,c_67]) ).
tff(c_86,plain,
( ( c = a )
| ( b = a )
| ~ reflexive_rewrite(a,b) ),
inference(resolution,[status(thm)],[c_2,c_79]) ).
tff(c_91,plain,
( ( c = a )
| ( b = a ) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_86]) ).
tff(c_92,plain,
b = a,
inference(splitLeft,[status(thm)],[c_91]) ).
tff(c_22,plain,
! [A_15] :
( ~ reflexive_rewrite(c,A_15)
| ~ reflexive_rewrite(b,A_15) ),
inference(negUnitSimplification,[status(thm)],[c_18,c_6]) ).
tff(c_27,plain,
~ reflexive_rewrite(b,c),
inference(resolution,[status(thm)],[c_8,c_22]) ).
tff(c_98,plain,
~ reflexive_rewrite(a,c),
inference(demodulation,[status(thm),theory(equality)],[c_92,c_27]) ).
tff(c_103,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_98]) ).
tff(c_104,plain,
c = a,
inference(splitRight,[status(thm)],[c_91]) ).
tff(c_125,plain,
! [A_38] :
( ~ reflexive_rewrite(a,A_38)
| ~ reflexive_rewrite(b,A_38) ),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_19]) ).
tff(c_137,plain,
~ reflexive_rewrite(a,b),
inference(resolution,[status(thm)],[c_8,c_125]) ).
tff(c_143,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : COM007+2 : TPTP v9.0.0. Released v3.2.0.
% 0.00/0.09 % 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.08/0.28 % Computer : n015.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Mon Apr 7 16:11:05 EDT 2025
% 0.08/0.28 % CPUTime :
% 3.52/2.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.52/2.37
% 3.52/2.37 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------