TSTP Solution File: SEU163+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU163+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 : n019.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:51 EDT 2023
% Result : Theorem 2.05s 1.60s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > #nlpp > union > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(union,type,
union: $i > $i ).
tff(in,type,
in: ( $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_39,negated_conjecture,
~ ! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t92_zfmisc_1) ).
tff(f_43,axiom,
! [A,B] :
( in(A,B)
=> subset(A,union(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).
tff(c_10,plain,
in('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_18,plain,
! [A_10,B_11] :
( subset(A_10,union(B_11))
| ~ in(A_10,B_11) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_8,plain,
~ subset('#skF_1',union('#skF_2')),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_21,plain,
~ in('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_18,c_8]) ).
tff(c_25,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU163+1 : TPTP v8.1.2. Released v3.3.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.16/0.36 % Computer : n019.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 11:32:16 EDT 2023
% 0.16/0.36 % CPUTime :
% 2.05/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.05/1.60
% 2.05/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.83/1.66
% 2.83/1.66 Inference rules
% 2.83/1.66 ----------------------
% 2.83/1.66 #Ref : 0
% 2.83/1.66 #Sup : 2
% 2.83/1.67 #Fact : 0
% 2.83/1.67 #Define : 0
% 2.83/1.67 #Split : 0
% 2.83/1.67 #Chain : 0
% 2.83/1.67 #Close : 0
% 2.83/1.67
% 2.83/1.67 Ordering : KBO
% 2.83/1.67
% 2.83/1.67 Simplification rules
% 2.83/1.67 ----------------------
% 2.83/1.67 #Subsume : 0
% 2.83/1.67 #Demod : 1
% 2.83/1.67 #Tautology : 1
% 2.83/1.67 #SimpNegUnit : 0
% 2.83/1.67 #BackRed : 0
% 2.83/1.67
% 2.83/1.67 #Partial instantiations: 0
% 2.83/1.67 #Strategies tried : 1
% 2.83/1.67
% 2.83/1.67 Timing (in seconds)
% 2.83/1.67 ----------------------
% 2.83/1.68 Preprocessing : 0.40
% 2.83/1.68 Parsing : 0.23
% 2.83/1.68 CNF conversion : 0.02
% 2.83/1.68 Main loop : 0.14
% 2.83/1.68 Inferencing : 0.06
% 2.83/1.68 Reduction : 0.03
% 2.83/1.68 Demodulation : 0.02
% 2.83/1.68 BG Simplification : 0.01
% 2.83/1.68 Subsumption : 0.03
% 2.83/1.68 Abstraction : 0.00
% 2.83/1.68 MUC search : 0.00
% 2.83/1.68 Cooper : 0.00
% 2.83/1.68 Total : 0.62
% 2.83/1.68 Index Insertion : 0.00
% 2.83/1.68 Index Deletion : 0.00
% 2.83/1.68 Index Matching : 0.00
% 2.83/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------