TSTP Solution File: SET949+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET949+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 : n006.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:24 EDT 2023
% Result : Theorem 3.64s 1.96s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 19
% Syntax : Number of formulae : 24 ( 4 unt; 17 typ; 0 def)
% Number of atoms : 13 ( 5 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 1 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 12 >; 18 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-4 aty)
% Number of variables : 18 (; 16 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > unordered_pair > ordered_pair > cartesian_product2 > #nlpp > singleton > #skF_1 > #skF_11 > #skF_4 > #skF_7 > #skF_10 > #skF_2 > #skF_6 > #skF_9 > #skF_8 > #skF_5 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(f_45,axiom,
! [A,B,C] :
( ( C = cartesian_product2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ? [E,F] :
( in(E,A)
& in(F,B)
& ( D = ordered_pair(E,F) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
tff(f_63,negated_conjecture,
~ ! [A,B,C] :
~ ( in(A,cartesian_product2(B,C))
& ! [D,E] : ( ordered_pair(D,E) != A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t102_zfmisc_1) ).
tff(c_571,plain,
! [A_96,B_97,D_98] :
( ( ordered_pair('#skF_5'(A_96,B_97,cartesian_product2(A_96,B_97),D_98),'#skF_6'(A_96,B_97,cartesian_product2(A_96,B_97),D_98)) = D_98 )
| ~ in(D_98,cartesian_product2(A_96,B_97)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_38,plain,
! [D_45,E_46] : ( ordered_pair(D_45,E_46) != '#skF_9' ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_605,plain,
! [A_96,B_97] : ~ in('#skF_9',cartesian_product2(A_96,B_97)),
inference(superposition,[status(thm),theory(equality)],[c_571,c_38]) ).
tff(c_40,plain,
in('#skF_9',cartesian_product2('#skF_10','#skF_11')),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_607,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_605,c_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET949+1 : TPTP v8.1.2. Released v3.2.0.
% 0.15/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.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 16:30:43 EDT 2023
% 0.21/0.35 % CPUTime :
% 3.64/1.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.64/1.96
% 3.64/1.96 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.64/1.98
% 3.64/1.98 Inference rules
% 3.64/1.98 ----------------------
% 3.64/1.98 #Ref : 0
% 3.64/1.98 #Sup : 154
% 3.64/1.98 #Fact : 0
% 3.64/1.98 #Define : 0
% 3.64/1.98 #Split : 0
% 3.64/1.98 #Chain : 0
% 3.64/1.98 #Close : 0
% 3.64/1.98
% 3.64/1.98 Ordering : KBO
% 3.64/1.98
% 3.64/1.98 Simplification rules
% 3.64/1.98 ----------------------
% 3.64/1.98 #Subsume : 7
% 3.64/1.98 #Demod : 58
% 3.64/1.98 #Tautology : 74
% 3.64/1.98 #SimpNegUnit : 1
% 3.64/1.98 #BackRed : 1
% 3.64/1.98
% 3.64/1.98 #Partial instantiations: 0
% 3.64/1.98 #Strategies tried : 1
% 3.64/1.98
% 3.64/1.98 Timing (in seconds)
% 3.64/1.98 ----------------------
% 3.64/1.98 Preprocessing : 0.51
% 3.64/1.98 Parsing : 0.25
% 3.64/1.98 CNF conversion : 0.05
% 3.64/1.98 Main loop : 0.42
% 3.64/1.98 Inferencing : 0.14
% 3.64/1.98 Reduction : 0.15
% 3.64/1.98 Demodulation : 0.12
% 3.64/1.98 BG Simplification : 0.02
% 3.64/1.98 Subsumption : 0.08
% 3.64/1.98 Abstraction : 0.02
% 3.64/1.98 MUC search : 0.00
% 3.64/1.98 Cooper : 0.00
% 3.64/1.98 Total : 0.96
% 3.64/1.99 Index Insertion : 0.00
% 3.64/1.99 Index Deletion : 0.00
% 3.64/1.99 Index Matching : 0.00
% 3.64/1.99 BG Taut test : 0.00
%------------------------------------------------------------------------------