TSTP Solution File: SET687+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET687+4 : 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 : n011.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:53 EDT 2023
% Result : Theorem 3.18s 1.83s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 23 ( 4 unt; 16 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 2 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 14 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 2 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > equal_set > unordered_pair > union > intersection > difference > #nlpp > sum > singleton > product > power_set > empty_set > #skF_3 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equal_set,type,
equal_set: ( $i * $i ) > $o ).
tff(power_set,type,
power_set: $i > $i ).
tff(product,type,
product: $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(sum,type,
sum: $i > $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_56,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
tff(f_117,negated_conjecture,
~ ! [A] : subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI01) ).
tff(c_107,plain,
! [A_65,B_66] :
( member('#skF_1'(A_65,B_66),A_65)
| subset(A_65,B_66) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_4,plain,
! [A_1,B_2] :
( ~ member('#skF_1'(A_1,B_2),B_2)
| subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_134,plain,
! [A_65] : subset(A_65,A_65),
inference(resolution,[status(thm)],[c_107,c_4]) ).
tff(c_60,plain,
~ subset('#skF_4','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_140,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_134,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET687+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/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.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 16:36:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.18/1.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.18/1.83
% 3.18/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.18/1.86
% 3.18/1.86 Inference rules
% 3.18/1.86 ----------------------
% 3.18/1.86 #Ref : 0
% 3.18/1.86 #Sup : 13
% 3.18/1.86 #Fact : 0
% 3.18/1.86 #Define : 0
% 3.18/1.86 #Split : 0
% 3.18/1.86 #Chain : 0
% 3.18/1.86 #Close : 0
% 3.18/1.86
% 3.18/1.86 Ordering : KBO
% 3.18/1.86
% 3.18/1.86 Simplification rules
% 3.18/1.86 ----------------------
% 3.18/1.86 #Subsume : 1
% 3.18/1.86 #Demod : 1
% 3.18/1.86 #Tautology : 2
% 3.18/1.86 #SimpNegUnit : 0
% 3.18/1.86 #BackRed : 1
% 3.18/1.86
% 3.18/1.86 #Partial instantiations: 0
% 3.18/1.86 #Strategies tried : 1
% 3.18/1.86
% 3.18/1.86 Timing (in seconds)
% 3.18/1.86 ----------------------
% 3.18/1.86 Preprocessing : 0.50
% 3.18/1.86 Parsing : 0.26
% 3.18/1.86 CNF conversion : 0.04
% 3.18/1.86 Main loop : 0.24
% 3.18/1.86 Inferencing : 0.09
% 3.18/1.86 Reduction : 0.06
% 3.18/1.86 Demodulation : 0.05
% 3.18/1.86 BG Simplification : 0.02
% 3.18/1.86 Subsumption : 0.06
% 3.18/1.86 Abstraction : 0.01
% 3.18/1.86 MUC search : 0.00
% 3.18/1.86 Cooper : 0.00
% 3.18/1.86 Total : 0.78
% 3.18/1.86 Index Insertion : 0.00
% 3.18/1.86 Index Deletion : 0.00
% 3.18/1.86 Index Matching : 0.00
% 3.18/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------