%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN049-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 : n023.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:02:17 PM UTC 2025
% Result : Unsatisfiable 2.12s 1.42s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 7 ( 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp > g > f
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_q,type,
big_q: $i > $o ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(f_31,axiom,
! [X] : ~ big_q(X),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X] : big_p(X),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X] :
( ~ big_p(f(X))
| big_q(g(X)) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_3] : ~ big_q(X_3),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_4,plain,
! [X_2] : big_p(X_2),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2,plain,
! [X_1] :
( big_q(g(X_1))
| ~ big_p(f(X_1)) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_8,plain,
! [X_1] : big_q(g(X_1)),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_2]) ).
tff(c_9,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN049-1 : TPTP v9.0.0. Released v1.0.0.
% 0.11/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.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Apr 9 06:53:54 EDT 2025
% 0.13/0.33 % CPUTime :
% 2.12/1.42 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.12/1.42
% 2.12/1.42 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------