TSTP Solution File: SEU130+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU130+2 : TPTP v8.1.2. Released v3.3.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 : n010.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:41 EDT 2023
% Result : Theorem 8.51s 3.14s
% Output : CNFRefutation 8.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 25
% Syntax : Number of formulae : 40 ( 13 unt; 19 typ; 0 def)
% Number of atoms : 32 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 9 ~; 7 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 14 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_union2 > set_intersection2 > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_1 > #skF_7 > #skF_10 > #skF_12 > #skF_5 > #skF_2 > #skF_9 > #skF_8 > #skF_3 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $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_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_134,negated_conjecture,
~ ! [A,B] :
( subset(A,B)
=> ( set_intersection2(A,B) = A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
tff(f_35,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_111,lemma,
! [A,B] : subset(set_intersection2(A,B),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
tff(f_94,axiom,
! [A,B] : ( set_intersection2(A,A) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
tff(f_129,lemma,
! [A,B,C] :
( subset(A,B)
=> subset(set_intersection2(A,C),set_intersection2(B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
tff(f_41,axiom,
! [A,B] :
( ( A = B )
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
tff(c_100,plain,
set_intersection2('#skF_9','#skF_10') != '#skF_9',
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_102,plain,
subset('#skF_9','#skF_10'),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_468,plain,
! [B_116,A_117] : ( set_intersection2(B_116,A_117) = set_intersection2(A_117,B_116) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_90,plain,
! [A_46,B_47] : subset(set_intersection2(A_46,B_47),A_46),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_491,plain,
! [B_116,A_117] : subset(set_intersection2(B_116,A_117),A_117),
inference(superposition,[status(thm),theory(equality)],[c_468,c_90]) ).
tff(c_78,plain,
! [A_38] : ( set_intersection2(A_38,A_38) = A_38 ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_3227,plain,
! [A_270,C_271,B_272] :
( subset(set_intersection2(A_270,C_271),set_intersection2(B_272,C_271))
| ~ subset(A_270,B_272) ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_7957,plain,
! [A_448,B_449] :
( subset(A_448,set_intersection2(B_449,A_448))
| ~ subset(A_448,B_449) ),
inference(superposition,[status(thm),theory(equality)],[c_78,c_3227]) ).
tff(c_8,plain,
! [B_8,A_7] :
( ( B_8 = A_7 )
| ~ subset(B_8,A_7)
| ~ subset(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_7978,plain,
! [B_449,A_448] :
( ( set_intersection2(B_449,A_448) = A_448 )
| ~ subset(set_intersection2(B_449,A_448),A_448)
| ~ subset(A_448,B_449) ),
inference(resolution,[status(thm)],[c_7957,c_8]) ).
tff(c_8018,plain,
! [B_450,A_451] :
( ( set_intersection2(B_450,A_451) = A_451 )
| ~ subset(A_451,B_450) ),
inference(demodulation,[status(thm),theory(equality)],[c_491,c_7978]) ).
tff(c_8138,plain,
set_intersection2('#skF_10','#skF_9') = '#skF_9',
inference(resolution,[status(thm)],[c_102,c_8018]) ).
tff(c_6,plain,
! [B_6,A_5] : ( set_intersection2(B_6,A_5) = set_intersection2(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8311,plain,
set_intersection2('#skF_9','#skF_10') = '#skF_9',
inference(superposition,[status(thm),theory(equality)],[c_8138,c_6]) ).
tff(c_8364,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_100,c_8311]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU130+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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 : n010.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 11:25:13 EDT 2023
% 0.15/0.35 % CPUTime :
% 8.51/3.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.51/3.14
% 8.51/3.14 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.51/3.17
% 8.51/3.17 Inference rules
% 8.51/3.17 ----------------------
% 8.51/3.17 #Ref : 1
% 8.51/3.17 #Sup : 2196
% 8.51/3.17 #Fact : 2
% 8.51/3.17 #Define : 0
% 8.51/3.17 #Split : 5
% 8.51/3.17 #Chain : 0
% 8.51/3.17 #Close : 0
% 8.51/3.17
% 8.51/3.17 Ordering : KBO
% 8.51/3.17
% 8.51/3.17 Simplification rules
% 8.51/3.17 ----------------------
% 8.51/3.17 #Subsume : 948
% 8.51/3.17 #Demod : 577
% 8.51/3.17 #Tautology : 662
% 8.51/3.17 #SimpNegUnit : 29
% 8.51/3.17 #BackRed : 5
% 8.51/3.17
% 8.51/3.17 #Partial instantiations: 0
% 8.51/3.17 #Strategies tried : 1
% 8.51/3.17
% 8.51/3.17 Timing (in seconds)
% 8.51/3.17 ----------------------
% 8.51/3.17 Preprocessing : 0.71
% 8.51/3.17 Parsing : 0.41
% 8.51/3.17 CNF conversion : 0.06
% 8.51/3.17 Main loop : 1.35
% 8.51/3.17 Inferencing : 0.44
% 8.51/3.17 Reduction : 0.47
% 8.51/3.17 Demodulation : 0.36
% 8.51/3.17 BG Simplification : 0.05
% 8.51/3.17 Subsumption : 0.30
% 8.51/3.17 Abstraction : 0.06
% 8.51/3.17 MUC search : 0.00
% 8.51/3.17 Cooper : 0.00
% 8.51/3.17 Total : 2.11
% 8.51/3.17 Index Insertion : 0.00
% 8.51/3.17 Index Deletion : 0.00
% 8.51/3.17 Index Matching : 0.00
% 8.51/3.17 BG Taut test : 0.00
%------------------------------------------------------------------------------