TSTP Solution File: SEU122+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU122+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 : n027.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:39 EDT 2023
% Result : Theorem 2.23s 1.65s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 23 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 23 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 4 |; 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 : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 (; 14 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > #nlpp > empty_set > #skF_2 > #skF_3 > #skF_4 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_42,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_38,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_59,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
tff(f_54,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_50,negated_conjecture,
~ ! [A] : subset(empty_set,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
tff(c_14,plain,
empty('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_59,plain,
! [A_26,B_27] :
( in('#skF_1'(A_26,B_27),A_26)
| subset(A_26,B_27) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_24,plain,
! [B_12,A_11] :
( ~ empty(B_12)
| ~ in(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_73,plain,
! [A_28,B_29] :
( ~ empty(A_28)
| subset(A_28,B_29) ),
inference(resolution,[status(thm)],[c_59,c_24]) ).
tff(c_28,plain,
! [A_16] :
( ( empty_set = A_16 )
| ~ empty(A_16) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_35,plain,
empty_set = '#skF_2',
inference(resolution,[status(thm)],[c_14,c_28]) ).
tff(c_20,plain,
~ subset(empty_set,'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_39,plain,
~ subset('#skF_2','#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_35,c_20]) ).
tff(c_76,plain,
~ empty('#skF_2'),
inference(resolution,[status(thm)],[c_73,c_39]) ).
tff(c_80,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU122+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.18/0.35 % Computer : n027.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 12:24:38 EDT 2023
% 0.18/0.35 % CPUTime :
% 2.23/1.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.66
% 2.23/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.23/1.68
% 2.23/1.68 Inference rules
% 2.23/1.68 ----------------------
% 2.23/1.68 #Ref : 0
% 2.23/1.68 #Sup : 10
% 2.23/1.68 #Fact : 0
% 2.23/1.68 #Define : 0
% 2.23/1.68 #Split : 0
% 2.23/1.68 #Chain : 0
% 2.23/1.68 #Close : 0
% 2.23/1.68
% 2.23/1.68 Ordering : KBO
% 2.23/1.68
% 2.23/1.68 Simplification rules
% 2.23/1.68 ----------------------
% 2.23/1.68 #Subsume : 1
% 2.23/1.68 #Demod : 6
% 2.23/1.68 #Tautology : 7
% 2.23/1.68 #SimpNegUnit : 0
% 2.23/1.68 #BackRed : 3
% 2.23/1.68
% 2.23/1.68 #Partial instantiations: 0
% 2.23/1.68 #Strategies tried : 1
% 2.23/1.68
% 2.23/1.68 Timing (in seconds)
% 2.23/1.68 ----------------------
% 2.23/1.69 Preprocessing : 0.43
% 2.23/1.69 Parsing : 0.24
% 2.23/1.69 CNF conversion : 0.03
% 2.23/1.69 Main loop : 0.21
% 2.23/1.69 Inferencing : 0.10
% 2.23/1.69 Reduction : 0.05
% 2.23/1.69 Demodulation : 0.03
% 2.23/1.69 BG Simplification : 0.01
% 2.23/1.69 Subsumption : 0.04
% 2.23/1.69 Abstraction : 0.01
% 2.23/1.69 MUC search : 0.00
% 2.23/1.69 Cooper : 0.00
% 2.23/1.69 Total : 0.68
% 2.23/1.69 Index Insertion : 0.00
% 2.23/1.69 Index Deletion : 0.00
% 2.23/1.69 Index Matching : 0.00
% 2.23/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------