TSTP Solution File: SEU139+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU139+1 : 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 : 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:57:43 EDT 2023
% Result : Theorem 2.60s 1.61s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 20 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 25 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 4 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_47,axiom,
! [A,B] : ~ proper_subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
tff(f_55,negated_conjecture,
~ ! [A,B] :
~ ( subset(A,B)
& proper_subset(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_xboole_1) ).
tff(f_44,axiom,
! [A,B] :
( proper_subset(A,B)
<=> ( subset(A,B)
& ( A != B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
tff(f_37,axiom,
! [A,B] :
( ( A = B )
<=> ( subset(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
tff(c_16,plain,
! [A_7] : ~ proper_subset(A_7,A_7),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_20,plain,
proper_subset('#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_14,plain,
! [A_5,B_6] :
( subset(A_5,B_6)
| ~ proper_subset(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_22,plain,
subset('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_32,plain,
! [B_17,A_18] :
( ( B_17 = A_18 )
| ~ subset(B_17,A_18)
| ~ subset(A_18,B_17) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_44,plain,
( ( '#skF_2' = '#skF_1' )
| ~ subset('#skF_2','#skF_1') ),
inference(resolution,[status(thm)],[c_22,c_32]) ).
tff(c_45,plain,
~ subset('#skF_2','#skF_1'),
inference(splitLeft,[status(thm)],[c_44]) ).
tff(c_48,plain,
~ proper_subset('#skF_2','#skF_1'),
inference(resolution,[status(thm)],[c_14,c_45]) ).
tff(c_52,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_48]) ).
tff(c_53,plain,
'#skF_2' = '#skF_1',
inference(splitRight,[status(thm)],[c_44]) ).
tff(c_56,plain,
proper_subset('#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_53,c_20]) ).
tff(c_59,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU139+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % 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.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 11:40:56 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.60/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.60/1.61
% 2.60/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.60/1.64
% 2.60/1.64 Inference rules
% 2.60/1.64 ----------------------
% 2.60/1.64 #Ref : 0
% 2.60/1.64 #Sup : 5
% 2.60/1.64 #Fact : 0
% 2.60/1.64 #Define : 0
% 2.60/1.64 #Split : 1
% 2.60/1.64 #Chain : 0
% 2.60/1.64 #Close : 0
% 2.60/1.64
% 2.60/1.64 Ordering : KBO
% 2.60/1.64
% 2.60/1.64 Simplification rules
% 2.60/1.64 ----------------------
% 2.60/1.64 #Subsume : 2
% 2.60/1.64 #Demod : 7
% 2.60/1.64 #Tautology : 3
% 2.60/1.64 #SimpNegUnit : 1
% 2.60/1.64 #BackRed : 3
% 2.60/1.64
% 2.60/1.64 #Partial instantiations: 0
% 2.60/1.64 #Strategies tried : 1
% 2.60/1.64
% 2.60/1.64 Timing (in seconds)
% 2.60/1.64 ----------------------
% 2.82/1.64 Preprocessing : 0.43
% 2.82/1.64 Parsing : 0.23
% 2.82/1.64 CNF conversion : 0.03
% 2.82/1.64 Main loop : 0.17
% 2.82/1.64 Inferencing : 0.06
% 2.82/1.64 Reduction : 0.04
% 2.82/1.64 Demodulation : 0.03
% 2.82/1.64 BG Simplification : 0.01
% 2.82/1.64 Subsumption : 0.05
% 2.82/1.64 Abstraction : 0.01
% 2.82/1.64 MUC search : 0.00
% 2.82/1.64 Cooper : 0.00
% 2.82/1.64 Total : 0.64
% 2.82/1.64 Index Insertion : 0.00
% 2.82/1.65 Index Deletion : 0.00
% 2.82/1.65 Index Matching : 0.00
% 2.82/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------