%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU247+1 : TPTP v9.0.0. Released v3.3.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 : n006.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 08:53:22 PM UTC 2025
% Result : Theorem 2.85s 1.65s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 3 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ relation > set_intersection2 > relation_rng_restriction > relation_restriction > relation_dom_restriction > cartesian_product2 > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff(relation_rng_restriction,type,
relation_rng_restriction: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(relation_dom_restriction,type,
relation_dom_restriction: ( $i * $i ) > $i ).
tff(relation_restriction,type,
relation_restriction: ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(f_61,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> ( relation_restriction(B,A) = relation_rng_restriction(A,relation_dom_restriction(B,A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_wellord1) ).
tff(f_56,axiom,
! [A,B] :
( relation(B)
=> ( relation_restriction(B,A) = relation_dom_restriction(relation_rng_restriction(A,B),A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_wellord1) ).
tff(f_52,axiom,
! [A,B,C] :
( relation(C)
=> ( relation_dom_restriction(relation_rng_restriction(A,C),B) = relation_rng_restriction(A,relation_dom_restriction(C,B)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t140_relat_1) ).
tff(c_24,plain,
relation('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_20,plain,
! [A_17,B_18] :
( ( relation_dom_restriction(relation_rng_restriction(A_17,B_18),A_17) = relation_restriction(B_18,A_17) )
| ~ relation(B_18) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_113,plain,
! [A_32,C_33,B_34] :
( ( relation_rng_restriction(A_32,relation_dom_restriction(C_33,B_34)) = relation_dom_restriction(relation_rng_restriction(A_32,C_33),B_34) )
| ~ relation(C_33) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_22,plain,
relation_rng_restriction('#skF_1',relation_dom_restriction('#skF_2','#skF_1')) != relation_restriction('#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_122,plain,
( ( relation_dom_restriction(relation_rng_restriction('#skF_1','#skF_2'),'#skF_1') != relation_restriction('#skF_2','#skF_1') )
| ~ relation('#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_113,c_22]) ).
tff(c_134,plain,
relation_dom_restriction(relation_rng_restriction('#skF_1','#skF_2'),'#skF_1') != relation_restriction('#skF_2','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_122]) ).
tff(c_138,plain,
~ relation('#skF_2'),
inference(superposition,[status(thm),theory(equality)],[c_20,c_134]) ).
tff(c_142,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU247+1 : TPTP v9.0.0. Released v3.3.0.
% 0.13/0.15 % 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.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 8 22:30:37 EDT 2025
% 0.14/0.36 % CPUTime :
% 2.85/1.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.66
% 2.85/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------