TSTP Solution File: SET574+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET574+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 : n004.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:35 EDT 2023
% Result : Theorem 2.46s 1.56s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 15 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 3 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 10 (; 9 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ member > intersect > #nlpp > #skF_2 > #skF_3 > #skF_4 > #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('#skF_4',type,
'#skF_4': $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_47,negated_conjecture,
~ ! [B,C,D] :
( ( member(B,C)
& member(B,D) )
=> intersect(C,D) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th13) ).
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_10,plain,
~ intersect('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_14,plain,
member('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_12,plain,
member('#skF_2','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_18,plain,
! [B_14,C_15,D_16] :
( intersect(B_14,C_15)
| ~ member(D_16,C_15)
| ~ member(D_16,B_14) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_31,plain,
! [B_17] :
( intersect(B_17,'#skF_4')
| ~ member('#skF_2',B_17) ),
inference(resolution,[status(thm)],[c_12,c_18]) ).
tff(c_37,plain,
intersect('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_14,c_31]) ).
tff(c_42,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET574+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 16:10:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.46/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.46/1.56
% 2.46/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.74/1.58
% 2.74/1.58 Inference rules
% 2.74/1.58 ----------------------
% 2.74/1.58 #Ref : 0
% 2.74/1.58 #Sup : 6
% 2.74/1.58 #Fact : 0
% 2.74/1.58 #Define : 0
% 2.74/1.58 #Split : 0
% 2.74/1.58 #Chain : 0
% 2.74/1.58 #Close : 0
% 2.74/1.58
% 2.74/1.58 Ordering : KBO
% 2.74/1.58
% 2.74/1.58 Simplification rules
% 2.74/1.58 ----------------------
% 2.74/1.58 #Subsume : 0
% 2.74/1.58 #Demod : 0
% 2.74/1.58 #Tautology : 0
% 2.74/1.58 #SimpNegUnit : 1
% 2.74/1.58 #BackRed : 0
% 2.74/1.58
% 2.74/1.58 #Partial instantiations: 0
% 2.74/1.58 #Strategies tried : 1
% 2.74/1.58
% 2.74/1.58 Timing (in seconds)
% 2.74/1.58 ----------------------
% 2.74/1.59 Preprocessing : 0.40
% 2.74/1.59 Parsing : 0.23
% 2.74/1.59 CNF conversion : 0.03
% 2.74/1.59 Main loop : 0.16
% 2.74/1.59 Inferencing : 0.07
% 2.74/1.59 Reduction : 0.03
% 2.74/1.59 Demodulation : 0.02
% 2.74/1.59 BG Simplification : 0.01
% 2.74/1.59 Subsumption : 0.04
% 2.74/1.59 Abstraction : 0.01
% 2.74/1.59 MUC search : 0.00
% 2.74/1.59 Cooper : 0.00
% 2.74/1.59 Total : 0.60
% 2.74/1.59 Index Insertion : 0.00
% 2.74/1.59 Index Deletion : 0.00
% 2.74/1.59 Index Matching : 0.00
% 2.74/1.59 BG Taut test : 0.00
%------------------------------------------------------------------------------