%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN035-1 : TPTP v9.0.0. Released v1.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 : Wed Apr 9 10:01:54 PM UTC 2025
% Result : Unsatisfiable 2.32s 1.55s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 16 ( 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > f > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: ( $i * $i ) > $o ).
tff(p,type,
p: ( $i * $i ) > $o ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_25,axiom,
! [A,B] : p(A,B),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A,B] :
( ~ p(f(A,B),f(A,B))
| ~ p(B,f(A,B))
| q(A,B) ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [A,B] :
( ~ q(f(A,B),f(A,B))
| ~ q(A,f(A,B))
| ~ p(f(A,B),f(A,B))
| ~ p(B,f(A,B)) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2] : p(A_1,B_2),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_4,plain,
! [A_3,B_4] :
( q(A_3,B_4)
| ~ p(B_4,f(A_3,B_4))
| ~ p(f(A_3,B_4),f(A_3,B_4)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_8,plain,
! [A_3,B_4] : q(A_3,B_4),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_4]) ).
tff(c_6,plain,
! [B_6,A_5] :
( ~ p(B_6,f(A_5,B_6))
| ~ p(f(A_5,B_6),f(A_5,B_6))
| ~ q(A_5,f(A_5,B_6))
| ~ q(f(A_5,B_6),f(A_5,B_6)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_10,plain,
! [A_5,B_6] :
( ~ q(A_5,f(A_5,B_6))
| ~ q(f(A_5,B_6),f(A_5,B_6)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_6]) ).
tff(c_12,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN035-1 : TPTP v9.0.0. Released v1.0.0.
% 0.08/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 : n007.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 : Wed Apr 9 06:51:54 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.32/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.32/1.55
% 2.32/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------