TSTP Solution File: SET913+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET913+1 : TPTP v8.1.2. Released v3.2.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 : n028.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 : Tue Aug 22 10:57:19 EDT 2023
% Result : Theorem 2.26s 1.60s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 1 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > #nlpp > singleton > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_46,negated_conjecture,
~ ! [A,B] :
~ ( disjoint(singleton(A),B)
& in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t54_zfmisc_1) ).
tff(f_51,axiom,
! [A,B] :
~ ( disjoint(singleton(A),B)
& in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l25_zfmisc_1) ).
tff(c_10,plain,
in('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_12,plain,
disjoint(singleton('#skF_3'),'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_27,plain,
! [A_11,B_12] :
( ~ in(A_11,B_12)
| ~ disjoint(singleton(A_11),B_12) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_30,plain,
~ in('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_12,c_27]) ).
tff(c_34,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET913+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % 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 : n028.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 16:30:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.26/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.26/1.60
% 2.26/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.26/1.64
% 2.26/1.64 Inference rules
% 2.26/1.64 ----------------------
% 2.26/1.64 #Ref : 0
% 2.26/1.64 #Sup : 4
% 2.26/1.64 #Fact : 0
% 2.26/1.64 #Define : 0
% 2.26/1.64 #Split : 0
% 2.26/1.64 #Chain : 0
% 2.26/1.64 #Close : 0
% 2.82/1.64
% 2.82/1.64 Ordering : KBO
% 2.82/1.64
% 2.82/1.64 Simplification rules
% 2.82/1.64 ----------------------
% 2.82/1.64 #Subsume : 0
% 2.82/1.64 #Demod : 2
% 2.82/1.64 #Tautology : 1
% 2.82/1.64 #SimpNegUnit : 0
% 2.82/1.64 #BackRed : 0
% 2.82/1.64
% 2.82/1.64 #Partial instantiations: 0
% 2.82/1.64 #Strategies tried : 1
% 2.82/1.64
% 2.82/1.64 Timing (in seconds)
% 2.82/1.64 ----------------------
% 2.82/1.64 Preprocessing : 0.40
% 2.82/1.64 Parsing : 0.23
% 2.82/1.64 CNF conversion : 0.02
% 2.82/1.64 Main loop : 0.16
% 2.82/1.64 Inferencing : 0.07
% 2.82/1.64 Reduction : 0.03
% 2.82/1.64 Demodulation : 0.02
% 2.82/1.64 BG Simplification : 0.01
% 2.82/1.64 Subsumption : 0.04
% 2.82/1.64 Abstraction : 0.00
% 2.82/1.64 MUC search : 0.00
% 2.82/1.64 Cooper : 0.00
% 2.82/1.64 Total : 0.62
% 2.82/1.64 Index Insertion : 0.00
% 2.82/1.64 Index Deletion : 0.00
% 2.82/1.64 Index Matching : 0.00
% 2.82/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------