TSTP Solution File: SET355+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET355+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/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 : 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:22 EDT 2023
% Result : Theorem 10.69s 3.70s
% Output : CNFRefutation 10.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 29 ( 4 unt; 17 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 20 ( 8 ~; 7 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 14 ( 14 usr; 3 con; 0-2 aty)
% Number of variables : 20 (; 19 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > equal_set > unordered_pair > union > intersection > difference > #nlpp > sum > singleton > product > power_set > empty_set > #skF_3 > #skF_5 > #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('#skF_5',type,
'#skF_5': $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_119,negated_conjecture,
~ ! [A,X] :
( member(X,A)
=> subset(X,sum(A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI43) ).
tff(f_56,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
tff(f_105,axiom,
! [X,A] :
( member(X,sum(A))
<=> ? [Y] :
( member(Y,A)
& member(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',sum) ).
tff(c_62,plain,
member('#skF_5','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_6,plain,
! [A_1,B_2] :
( member('#skF_1'(A_1,B_2),A_1)
| subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_896,plain,
! [X_157,A_158,Y_159] :
( member(X_157,sum(A_158))
| ~ member(X_157,Y_159)
| ~ member(Y_159,A_158) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_9670,plain,
! [A_502,B_503,A_504] :
( member('#skF_1'(A_502,B_503),sum(A_504))
| ~ member(A_502,A_504)
| subset(A_502,B_503) ),
inference(resolution,[status(thm)],[c_6,c_896]) ).
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_9735,plain,
! [A_506,A_507] :
( ~ member(A_506,A_507)
| subset(A_506,sum(A_507)) ),
inference(resolution,[status(thm)],[c_9670,c_4]) ).
tff(c_60,plain,
~ subset('#skF_5',sum('#skF_4')),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_9796,plain,
~ member('#skF_5','#skF_4'),
inference(resolution,[status(thm)],[c_9735,c_60]) ).
tff(c_9817,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_62,c_9796]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET355+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % 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.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:15:27 EDT 2023
% 0.13/0.34 % CPUTime :
% 10.69/3.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.69/3.70
% 10.69/3.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.96/3.74
% 10.96/3.74 Inference rules
% 10.96/3.74 ----------------------
% 10.96/3.74 #Ref : 0
% 10.96/3.74 #Sup : 2136
% 10.96/3.74 #Fact : 0
% 10.96/3.74 #Define : 0
% 10.96/3.74 #Split : 9
% 10.96/3.74 #Chain : 0
% 10.96/3.74 #Close : 0
% 10.96/3.74
% 10.96/3.74 Ordering : KBO
% 10.96/3.74
% 10.96/3.74 Simplification rules
% 10.96/3.74 ----------------------
% 10.96/3.74 #Subsume : 118
% 10.96/3.74 #Demod : 496
% 10.96/3.74 #Tautology : 510
% 10.96/3.74 #SimpNegUnit : 20
% 10.96/3.74 #BackRed : 2
% 10.96/3.74
% 10.96/3.74 #Partial instantiations: 0
% 10.96/3.74 #Strategies tried : 1
% 10.96/3.74
% 10.96/3.74 Timing (in seconds)
% 10.96/3.74 ----------------------
% 10.96/3.74 Preprocessing : 0.53
% 10.96/3.74 Parsing : 0.28
% 10.96/3.74 CNF conversion : 0.04
% 10.96/3.74 Main loop : 2.13
% 10.96/3.74 Inferencing : 0.67
% 10.96/3.74 Reduction : 0.73
% 10.96/3.74 Demodulation : 0.52
% 10.96/3.74 BG Simplification : 0.05
% 10.96/3.74 Subsumption : 0.52
% 10.96/3.74 Abstraction : 0.05
% 10.96/3.74 MUC search : 0.00
% 10.96/3.74 Cooper : 0.00
% 10.96/3.74 Total : 2.71
% 10.96/3.74 Index Insertion : 0.00
% 10.96/3.74 Index Deletion : 0.00
% 10.96/3.74 Index Matching : 0.00
% 10.96/3.74 BG Taut test : 0.00
%------------------------------------------------------------------------------