TSTP Solution File: SET899+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET899+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 : n019.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:18 EDT 2023
% Result : Theorem 2.53s 1.67s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of formulae : 19 ( 5 unt; 10 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 5 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > set_difference > #nlpp > singleton > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $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('#skF_4',type,
'#skF_4': $i ).
tff(f_45,negated_conjecture,
~ ! [A,B,C] :
( subset(A,B)
=> ( in(C,A)
| subset(A,set_difference(B,singleton(C))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_zfmisc_1) ).
tff(f_51,axiom,
! [A,B,C] :
( subset(A,B)
=> ( in(C,A)
| subset(A,set_difference(B,singleton(C))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).
tff(c_12,plain,
~ in('#skF_5','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_14,plain,
subset('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_19,plain,
! [A_11,B_12,C_13] :
( subset(A_11,set_difference(B_12,singleton(C_13)))
| in(C_13,A_11)
| ~ subset(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_10,plain,
~ subset('#skF_3',set_difference('#skF_4',singleton('#skF_5'))),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_22,plain,
( in('#skF_5','#skF_3')
| ~ subset('#skF_3','#skF_4') ),
inference(resolution,[status(thm)],[c_19,c_10]) ).
tff(c_25,plain,
in('#skF_5','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_22]) ).
tff(c_27,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET899+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.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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 : Thu Aug 3 16:16:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.53/1.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.53/1.68
% 2.53/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.83/1.71
% 2.83/1.71 Inference rules
% 2.83/1.71 ----------------------
% 2.83/1.71 #Ref : 0
% 2.83/1.71 #Sup : 1
% 2.83/1.71 #Fact : 0
% 2.83/1.71 #Define : 0
% 2.83/1.71 #Split : 0
% 2.83/1.71 #Chain : 0
% 2.83/1.71 #Close : 0
% 2.83/1.71
% 2.83/1.71 Ordering : KBO
% 2.83/1.71
% 2.83/1.71 Simplification rules
% 2.83/1.71 ----------------------
% 2.83/1.71 #Subsume : 0
% 2.83/1.71 #Demod : 1
% 2.83/1.71 #Tautology : 0
% 2.83/1.71 #SimpNegUnit : 1
% 2.83/1.71 #BackRed : 0
% 2.83/1.71
% 2.83/1.71 #Partial instantiations: 0
% 2.83/1.71 #Strategies tried : 1
% 2.83/1.71
% 2.83/1.71 Timing (in seconds)
% 2.83/1.71 ----------------------
% 2.83/1.71 Preprocessing : 0.42
% 2.83/1.71 Parsing : 0.23
% 2.83/1.71 CNF conversion : 0.03
% 2.83/1.71 Main loop : 0.14
% 2.83/1.71 Inferencing : 0.07
% 2.83/1.71 Reduction : 0.03
% 2.83/1.71 Demodulation : 0.02
% 2.83/1.71 BG Simplification : 0.01
% 2.83/1.71 Subsumption : 0.03
% 2.83/1.71 Abstraction : 0.00
% 2.83/1.72 MUC search : 0.00
% 2.83/1.72 Cooper : 0.00
% 2.83/1.72 Total : 0.61
% 2.83/1.72 Index Insertion : 0.00
% 2.83/1.72 Index Deletion : 0.00
% 2.83/1.72 Index Matching : 0.00
% 2.83/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------