TSTP Solution File: SET910+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET910+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/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 : n015.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.18s 1.63s
% Output : CNFRefutation 2.43s
% 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 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > set_intersection2 > #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(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_45,negated_conjecture,
~ ! [A,B] :
( ( set_intersection2(A,singleton(B)) = singleton(B) )
=> in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t51_zfmisc_1) ).
tff(f_49,axiom,
! [A,B] :
( ( set_intersection2(A,singleton(B)) = singleton(B) )
=> in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_zfmisc_1) ).
tff(c_12,plain,
~ in('#skF_4','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_14,plain,
set_intersection2('#skF_3',singleton('#skF_4')) = singleton('#skF_4'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_64,plain,
! [B_14,A_15] :
( in(B_14,A_15)
| ( set_intersection2(A_15,singleton(B_14)) != singleton(B_14) ) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_75,plain,
in('#skF_4','#skF_3'),
inference(superposition,[status(thm),theory(equality)],[c_14,c_64]) ).
tff(c_83,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SET910+1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.15 % 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.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:08:59 EDT 2023
% 0.21/0.36 % CPUTime :
% 2.18/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.18/1.63
% 2.18/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.43/1.67
% 2.43/1.67 Inference rules
% 2.43/1.67 ----------------------
% 2.43/1.67 #Ref : 0
% 2.43/1.67 #Sup : 16
% 2.43/1.67 #Fact : 0
% 2.43/1.67 #Define : 0
% 2.43/1.67 #Split : 0
% 2.43/1.67 #Chain : 0
% 2.43/1.67 #Close : 0
% 2.43/1.67
% 2.43/1.67 Ordering : KBO
% 2.43/1.67
% 2.43/1.67 Simplification rules
% 2.43/1.67 ----------------------
% 2.43/1.67 #Subsume : 0
% 2.43/1.67 #Demod : 0
% 2.43/1.67 #Tautology : 12
% 2.43/1.67 #SimpNegUnit : 1
% 2.43/1.67 #BackRed : 0
% 2.43/1.67
% 2.43/1.67 #Partial instantiations: 0
% 2.43/1.67 #Strategies tried : 1
% 2.43/1.67
% 2.43/1.67 Timing (in seconds)
% 2.43/1.67 ----------------------
% 2.43/1.68 Preprocessing : 0.42
% 2.43/1.68 Parsing : 0.23
% 2.43/1.68 CNF conversion : 0.02
% 2.43/1.68 Main loop : 0.18
% 2.43/1.68 Inferencing : 0.07
% 2.43/1.68 Reduction : 0.04
% 2.43/1.68 Demodulation : 0.03
% 2.43/1.68 BG Simplification : 0.01
% 2.43/1.68 Subsumption : 0.04
% 2.43/1.68 Abstraction : 0.01
% 2.43/1.68 MUC search : 0.00
% 2.43/1.68 Cooper : 0.00
% 2.43/1.68 Total : 0.66
% 2.43/1.68 Index Insertion : 0.00
% 2.43/1.68 Index Deletion : 0.00
% 2.43/1.68 Index Matching : 0.00
% 2.43/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------