TSTP Solution File: SET988+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET988+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/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 : n020.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:28 EDT 2023
% Result : Theorem 4.73s 2.18s
% Output : CNFRefutation 4.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 33
% Syntax : Number of formulae : 52 ( 6 unt; 30 typ; 0 def)
% Number of atoms : 49 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 16 |; 6 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 22 >; 7 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 8 con; 0-2 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > function > empty > unordered_pair > ordered_pair > #nlpp > singleton > powerset > empty_set > #skF_16 > #skF_4 > #skF_1 > #skF_17 > #skF_7 > #skF_10 > #skF_15 > #skF_18 > #skF_5 > #skF_6 > #skF_2 > #skF_9 > #skF_8 > #skF_13 > #skF_3 > #skF_11 > #skF_14 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(f_169,negated_conjecture,
~ ! [A] :
( ( ! [B] :
~ ( in(B,A)
& ! [C,D] : ( ordered_pair(C,D) != B ) )
& ! [B,C,D] :
( ( in(ordered_pair(B,C),A)
& in(ordered_pair(B,D),A) )
=> ( C = D ) ) )
=> ( relation(A)
& function(A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_funct_1) ).
tff(f_188,axiom,
! [A] :
( relation(A)
<=> ! [B] :
~ ( in(B,A)
& ! [C,D] : ( B != ordered_pair(C,D) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_1) ).
tff(f_178,axiom,
! [A] :
( function(A)
<=> ! [B,C,D] :
( ( in(ordered_pair(B,C),A)
& in(ordered_pair(B,D),A) )
=> ( C = D ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_funct_1) ).
tff(c_82,plain,
( ~ function('#skF_10')
| ~ relation('#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_104,plain,
~ relation('#skF_10'),
inference(splitLeft,[status(thm)],[c_82]) ).
tff(c_100,plain,
! [A_64] :
( in('#skF_16'(A_64),A_64)
| relation(A_64) ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_86,plain,
! [B_48] :
( ( ordered_pair('#skF_11'(B_48),'#skF_12'(B_48)) = B_48 )
| ~ in(B_48,'#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_292,plain,
! [C_126,D_127,A_128] :
( ( ordered_pair(C_126,D_127) != '#skF_16'(A_128) )
| relation(A_128) ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_293,plain,
! [B_48,A_128] :
( ( B_48 != '#skF_16'(A_128) )
| relation(A_128)
| ~ in(B_48,'#skF_10') ),
inference(superposition,[status(thm),theory(equality)],[c_86,c_292]) ).
tff(c_348,plain,
! [A_135] :
( relation(A_135)
| ~ in('#skF_16'(A_135),'#skF_10') ),
inference(reflexivity,[status(thm),theory(equality)],[c_293]) ).
tff(c_355,plain,
relation('#skF_10'),
inference(resolution,[status(thm)],[c_100,c_348]) ).
tff(c_362,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_104,c_104,c_355]) ).
tff(c_363,plain,
~ function('#skF_10'),
inference(splitRight,[status(thm)],[c_82]) ).
tff(c_470,plain,
! [A_162] :
( ( '#skF_15'(A_162) != '#skF_14'(A_162) )
| function(A_162) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_474,plain,
'#skF_15'('#skF_10') != '#skF_14'('#skF_10'),
inference(resolution,[status(thm)],[c_470,c_363]) ).
tff(c_94,plain,
! [A_54] :
( in(ordered_pair('#skF_13'(A_54),'#skF_14'(A_54)),A_54)
| function(A_54) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_835,plain,
! [A_217] :
( in(ordered_pair('#skF_13'(A_217),'#skF_15'(A_217)),A_217)
| function(A_217) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_84,plain,
! [D_53,C_52,B_51] :
( ( D_53 = C_52 )
| ~ in(ordered_pair(B_51,D_53),'#skF_10')
| ~ in(ordered_pair(B_51,C_52),'#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_866,plain,
! [C_52] :
( ( C_52 = '#skF_15'('#skF_10') )
| ~ in(ordered_pair('#skF_13'('#skF_10'),C_52),'#skF_10')
| function('#skF_10') ),
inference(resolution,[status(thm)],[c_835,c_84]) ).
tff(c_914,plain,
! [C_220] :
( ( C_220 = '#skF_15'('#skF_10') )
| ~ in(ordered_pair('#skF_13'('#skF_10'),C_220),'#skF_10') ),
inference(negUnitSimplification,[status(thm)],[c_363,c_866]) ).
tff(c_922,plain,
( ( '#skF_15'('#skF_10') = '#skF_14'('#skF_10') )
| function('#skF_10') ),
inference(resolution,[status(thm)],[c_94,c_914]) ).
tff(c_933,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_363,c_474,c_922]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET988+1 : TPTP v8.1.2. Released v3.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.36 % Computer : n020.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:36:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.73/2.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.73/2.19
% 4.73/2.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.91/2.21
% 4.91/2.21 Inference rules
% 4.91/2.21 ----------------------
% 4.91/2.21 #Ref : 2
% 4.91/2.21 #Sup : 173
% 4.91/2.21 #Fact : 0
% 4.91/2.21 #Define : 0
% 4.91/2.21 #Split : 2
% 4.91/2.21 #Chain : 0
% 4.91/2.21 #Close : 0
% 4.91/2.21
% 4.91/2.21 Ordering : KBO
% 4.91/2.21
% 4.91/2.21 Simplification rules
% 4.91/2.21 ----------------------
% 4.91/2.21 #Subsume : 21
% 4.91/2.21 #Demod : 44
% 4.91/2.21 #Tautology : 77
% 4.91/2.21 #SimpNegUnit : 22
% 4.91/2.21 #BackRed : 18
% 4.91/2.21
% 4.91/2.21 #Partial instantiations: 0
% 4.91/2.21 #Strategies tried : 1
% 4.91/2.21
% 4.91/2.21 Timing (in seconds)
% 4.91/2.21 ----------------------
% 4.91/2.22 Preprocessing : 0.55
% 4.91/2.22 Parsing : 0.30
% 4.91/2.22 CNF conversion : 0.04
% 4.91/2.22 Main loop : 0.52
% 4.91/2.22 Inferencing : 0.19
% 4.91/2.22 Reduction : 0.15
% 4.91/2.22 Demodulation : 0.11
% 4.91/2.22 BG Simplification : 0.03
% 4.91/2.22 Subsumption : 0.10
% 4.91/2.22 Abstraction : 0.02
% 4.91/2.22 MUC search : 0.00
% 4.91/2.22 Cooper : 0.00
% 4.91/2.22 Total : 1.11
% 4.91/2.22 Index Insertion : 0.00
% 4.91/2.22 Index Deletion : 0.00
% 4.91/2.22 Index Matching : 0.00
% 4.91/2.22 BG Taut test : 0.00
%------------------------------------------------------------------------------