%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN349+1 : TPTP v9.0.0. Released v2.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 : n004.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:03:18 PM UTC 2025
% Result : Theorem 3.07s 2.11s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 56 ( 23 ~; 28 |; 0 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 28 ( 26 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_40,negated_conjecture,
~ ? [X1] :
! [X2] :
? [X3] :
! [X4] :
( ( big_f(X1,X4)
<=> big_f(X2,X4) )
=> ( ( ( big_f(X1,X4)
<=> big_f(X4,X3) )
<=> big_f(X3,X4) )
<=> big_f(X4,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_17_5) ).
tff(c_228,plain,
! [X1_1,X3_12] :
( big_f(X1_1,'#skF_2'(X1_1,X3_12))
| big_f('#skF_2'(X1_1,X3_12),X3_12)
| big_f(X3_12,'#skF_2'(X1_1,X3_12))
| big_f('#skF_2'(X1_1,X3_12),'#skF_1'(X1_1)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_252,plain,
! [X1_1] :
( big_f(X1_1,'#skF_2'(X1_1,'#skF_1'(X1_1)))
| big_f('#skF_1'(X1_1),'#skF_2'(X1_1,'#skF_1'(X1_1)))
| big_f('#skF_2'(X1_1,'#skF_1'(X1_1)),'#skF_1'(X1_1)) ),
inference(factorization,[status(thm),theory(equality)],[c_228]) ).
tff(c_275,plain,
! [X1_30] :
( big_f(X1_30,'#skF_2'(X1_30,'#skF_1'(X1_30)))
| big_f('#skF_1'(X1_30),'#skF_2'(X1_30,'#skF_1'(X1_30)))
| big_f('#skF_2'(X1_30,'#skF_1'(X1_30)),'#skF_1'(X1_30)) ),
inference(factorization,[status(thm),theory(equality)],[c_228]) ).
tff(c_188,plain,
! [X1_1,X3_12] :
( ~ big_f('#skF_2'(X1_1,X3_12),'#skF_1'(X1_1))
| big_f(X1_1,'#skF_2'(X1_1,X3_12))
| ~ big_f('#skF_2'(X1_1,X3_12),X3_12)
| big_f(X3_12,'#skF_2'(X1_1,X3_12)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_299,plain,
! [X1_33] :
( ~ big_f('#skF_2'(X1_33,'#skF_1'(X1_33)),'#skF_1'(X1_33))
| big_f(X1_33,'#skF_2'(X1_33,'#skF_1'(X1_33)))
| big_f('#skF_1'(X1_33),'#skF_2'(X1_33,'#skF_1'(X1_33))) ),
inference(resolution,[status(thm)],[c_275,c_188]) ).
tff(c_308,plain,
! [X1_34] :
( big_f(X1_34,'#skF_2'(X1_34,'#skF_1'(X1_34)))
| big_f('#skF_1'(X1_34),'#skF_2'(X1_34,'#skF_1'(X1_34))) ),
inference(resolution,[status(thm)],[c_252,c_299]) ).
tff(c_2,plain,
! [X1_1,X3_12] :
( big_f(X1_1,'#skF_2'(X1_1,X3_12))
| ~ big_f('#skF_1'(X1_1),'#skF_2'(X1_1,X3_12)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_312,plain,
! [X1_34] : big_f(X1_34,'#skF_2'(X1_34,'#skF_1'(X1_34))),
inference(resolution,[status(thm)],[c_308,c_2]) ).
tff(c_4,plain,
! [X1_1,X3_12] :
( big_f('#skF_1'(X1_1),'#skF_2'(X1_1,X3_12))
| ~ big_f(X1_1,'#skF_2'(X1_1,X3_12)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_220,plain,
! [X1_1,X3_12] :
( big_f('#skF_2'(X1_1,X3_12),X3_12)
| ~ big_f(X1_1,'#skF_2'(X1_1,X3_12))
| ~ big_f(X3_12,'#skF_2'(X1_1,X3_12))
| big_f('#skF_2'(X1_1,X3_12),'#skF_1'(X1_1)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_326,plain,
! [X1_1] :
( ~ big_f(X1_1,'#skF_2'(X1_1,'#skF_1'(X1_1)))
| ~ big_f('#skF_1'(X1_1),'#skF_2'(X1_1,'#skF_1'(X1_1)))
| big_f('#skF_2'(X1_1,'#skF_1'(X1_1)),'#skF_1'(X1_1)) ),
inference(factorization,[status(thm),theory(equality)],[c_220]) ).
tff(c_329,plain,
! [X1_1] :
( ~ big_f('#skF_1'(X1_1),'#skF_2'(X1_1,'#skF_1'(X1_1)))
| big_f('#skF_2'(X1_1,'#skF_1'(X1_1)),'#skF_1'(X1_1)) ),
inference(demodulation,[status(thm),theory(equality)],[c_312,c_326]) ).
tff(c_358,plain,
! [X1_38] :
( ~ big_f('#skF_1'(X1_38),'#skF_2'(X1_38,'#skF_1'(X1_38)))
| big_f('#skF_2'(X1_38,'#skF_1'(X1_38)),'#skF_1'(X1_38)) ),
inference(demodulation,[status(thm),theory(equality)],[c_312,c_326]) ).
tff(c_6,plain,
! [X1_1,X3_12] :
( ~ big_f('#skF_2'(X1_1,X3_12),'#skF_1'(X1_1))
| ~ big_f(X3_12,'#skF_2'(X1_1,X3_12))
| ~ big_f('#skF_2'(X1_1,X3_12),X3_12)
| ~ big_f(X1_1,'#skF_2'(X1_1,X3_12)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_368,plain,
! [X1_38] :
( ~ big_f('#skF_2'(X1_38,'#skF_1'(X1_38)),'#skF_1'(X1_38))
| ~ big_f(X1_38,'#skF_2'(X1_38,'#skF_1'(X1_38)))
| ~ big_f('#skF_1'(X1_38),'#skF_2'(X1_38,'#skF_1'(X1_38))) ),
inference(resolution,[status(thm)],[c_358,c_6]) ).
tff(c_386,plain,
! [X1_39] :
( ~ big_f('#skF_2'(X1_39,'#skF_1'(X1_39)),'#skF_1'(X1_39))
| ~ big_f('#skF_1'(X1_39),'#skF_2'(X1_39,'#skF_1'(X1_39))) ),
inference(demodulation,[status(thm),theory(equality)],[c_312,c_368]) ).
tff(c_399,plain,
! [X1_40] : ~ big_f('#skF_1'(X1_40),'#skF_2'(X1_40,'#skF_1'(X1_40))),
inference(resolution,[status(thm)],[c_329,c_386]) ).
tff(c_403,plain,
! [X1_1] : ~ big_f(X1_1,'#skF_2'(X1_1,'#skF_1'(X1_1))),
inference(resolution,[status(thm)],[c_4,c_399]) ).
tff(c_407,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_312,c_403]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN349+1 : TPTP v9.0.0. Released v2.0.0.
% 0.08/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 : n004.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 : Wed Apr 9 07:19:22 EDT 2025
% 0.08/0.28 % CPUTime :
% 3.07/2.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/2.11
% 3.07/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------