%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN926+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n016.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:08:27 PM UTC 2025
% Result : Theorem 2.23s 1.38s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 1 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 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 : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 7 ( 4 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: $i > $o ).
tff(p,type,
p: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_36,negated_conjecture,
~ ( ? [X] :
( p(X)
& q(X) )
=> ( ? [X] : p(X)
& ? [X] : q(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_2,plain,
! [X_2,X_1] :
( ~ q(X_2)
| ~ p(X_1) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_7,plain,
! [X_1] : ~ p(X_1),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_6,plain,
p('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_9,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_7,c_6]) ).
tff(c_10,plain,
! [X_2] : ~ q(X_2),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_4,plain,
q('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_12,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SYN926+1 : TPTP v9.0.0. Released v3.1.0.
% 0.07/0.09 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.28 % Computer : n016.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Wed Apr 9 08:41:23 EDT 2025
% 0.09/0.28 % CPUTime :
% 2.23/1.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.23/1.38
% 2.23/1.38 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------