%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN011-1 : TPTP v9.0.0. Released v1.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 : 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:01:52 PM UTC 2025
% Result : Unsatisfiable 2.48s 1.55s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 20 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 8 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > t > r > q > p > n > m > l
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(t,type,
t: $o ).
tff(p,type,
p: $o ).
tff(q,type,
q: $o ).
tff(m,type,
m: $o ).
tff(l,type,
l: $o ).
tff(r,type,
r: $o ).
tff(n,type,
n: $o ).
tff(f_35,axiom,
( l
| ~ m ),
file(unknown,unknown) ).
tff(f_39,axiom,
( l
| ~ q ),
file(unknown,unknown) ).
tff(f_55,axiom,
t,
file(unknown,unknown) ).
tff(f_26,axiom,
( ~ n
| ~ t ),
file(unknown,unknown) ).
tff(f_31,axiom,
( m
| q
| n ),
file(unknown,unknown) ).
tff(f_49,axiom,
( r
| p
| n ),
file(unknown,unknown) ).
tff(f_54,axiom,
( ~ r
| ~ l ),
file(unknown,unknown) ).
tff(f_44,axiom,
( ~ l
| ~ p ),
file(unknown,unknown) ).
tff(c_6,plain,
( ~ m
| l ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_41,plain,
~ m,
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_8,plain,
( ~ q
| l ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_40,plain,
~ q,
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_16,plain,
t,
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_2,plain,
( ~ t
| ~ n ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_18,plain,
~ n,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_2]) ).
tff(c_4,plain,
( n
| q
| m ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_20,plain,
( q
| m ),
inference(negUnitSimplification,[status(thm)],[c_18,c_4]) ).
tff(c_44,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_41,c_40,c_20]) ).
tff(c_45,plain,
l,
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_12,plain,
( n
| p
| r ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_19,plain,
( p
| r ),
inference(negUnitSimplification,[status(thm)],[c_18,c_12]) ).
tff(c_21,plain,
r,
inference(splitLeft,[status(thm)],[c_19]) ).
tff(c_14,plain,
( ~ l
| ~ r ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_33,plain,
~ l,
inference(demodulation,[status(thm),theory(equality)],[c_21,c_14]) ).
tff(c_22,plain,
m,
inference(splitLeft,[status(thm)],[c_20]) ).
tff(c_25,plain,
l,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_6]) ).
tff(c_29,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_21,c_25,c_14]) ).
tff(c_30,plain,
q,
inference(splitRight,[status(thm)],[c_20]) ).
tff(c_36,plain,
l,
inference(demodulation,[status(thm),theory(equality)],[c_30,c_8]) ).
tff(c_37,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_33,c_36]) ).
tff(c_38,plain,
p,
inference(splitRight,[status(thm)],[c_19]) ).
tff(c_10,plain,
( ~ p
| ~ l ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_50,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_45,c_38,c_10]) ).
tff(c_51,plain,
l,
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_56,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_51,c_38,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN011-1 : TPTP v9.0.0. Released v1.1.0.
% 0.03/0.12 % 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.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Apr 9 06:51:39 EDT 2025
% 0.12/0.33 % CPUTime :
% 2.48/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.48/1.56
% 2.48/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------