TSTP Solution File: SET576+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET576+3 : TPTP v8.1.2. Released v2.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 : 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:56:36 EDT 2023
% Result : Theorem 2.33s 1.64s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 18 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 5 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 16 (; 15 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ member > intersect > disjoint > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(intersect,type,
intersect: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_55,negated_conjecture,
~ ! [B,C] :
( ! [D] :
( member(D,B)
=> ~ member(D,C) )
=> disjoint(B,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th17) ).
tff(f_40,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
tff(f_34,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
tff(c_14,plain,
~ disjoint('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_10,plain,
! [B_6,C_7] :
( disjoint(B_6,C_7)
| intersect(B_6,C_7) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_4,plain,
! [B_1,C_2] :
( member('#skF_1'(B_1,C_2),C_2)
| ~ intersect(B_1,C_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_28,plain,
! [B_19,C_20] :
( member('#skF_1'(B_19,C_20),B_19)
| ~ intersect(B_19,C_20) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_16,plain,
! [D_11] :
( ~ member(D_11,'#skF_3')
| ~ member(D_11,'#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_49,plain,
! [C_27] :
( ~ member('#skF_1'('#skF_2',C_27),'#skF_3')
| ~ intersect('#skF_2',C_27) ),
inference(resolution,[status(thm)],[c_28,c_16]) ).
tff(c_54,plain,
~ intersect('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_4,c_49]) ).
tff(c_60,plain,
disjoint('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_10,c_54]) ).
tff(c_65,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET576+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14 % 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 : n019.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 16:35:16 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.33/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/1.65
% 2.33/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.84/1.67
% 2.84/1.67 Inference rules
% 2.84/1.67 ----------------------
% 2.84/1.67 #Ref : 0
% 2.84/1.67 #Sup : 9
% 2.84/1.67 #Fact : 0
% 2.84/1.67 #Define : 0
% 2.84/1.67 #Split : 0
% 2.84/1.67 #Chain : 0
% 2.84/1.67 #Close : 0
% 2.84/1.67
% 2.84/1.67 Ordering : KBO
% 2.84/1.67
% 2.84/1.67 Simplification rules
% 2.84/1.67 ----------------------
% 2.84/1.67 #Subsume : 1
% 2.84/1.67 #Demod : 0
% 2.84/1.67 #Tautology : 1
% 2.84/1.67 #SimpNegUnit : 1
% 2.84/1.67 #BackRed : 0
% 2.84/1.67
% 2.84/1.67 #Partial instantiations: 0
% 2.84/1.67 #Strategies tried : 1
% 2.84/1.67
% 2.84/1.67 Timing (in seconds)
% 2.84/1.67 ----------------------
% 2.84/1.68 Preprocessing : 0.42
% 2.84/1.68 Parsing : 0.24
% 2.84/1.68 CNF conversion : 0.03
% 2.84/1.68 Main loop : 0.19
% 2.84/1.68 Inferencing : 0.10
% 2.84/1.68 Reduction : 0.02
% 2.84/1.68 Demodulation : 0.01
% 2.84/1.68 BG Simplification : 0.01
% 2.84/1.68 Subsumption : 0.04
% 2.84/1.68 Abstraction : 0.01
% 2.84/1.68 MUC search : 0.00
% 2.84/1.68 Cooper : 0.00
% 2.84/1.68 Total : 0.65
% 2.84/1.68 Index Insertion : 0.00
% 2.84/1.68 Index Deletion : 0.00
% 2.84/1.68 Index Matching : 0.00
% 2.84/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------