TSTP Solution File: SWW469_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW469_1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n017.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 11:07:19 EDT 2023
% Result : Theorem 2.96s 1.84s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 12 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 1 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 6 (; 4 !; 2 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > induct_true > induct_false > hoare_1310879719gleton > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
tff(state,type,
state: $tType ).
%Background operators:
%Foreground operators:
tff(hoare_1310879719gleton,type,
hoare_1310879719gleton: $o ).
tff('#skF_2',type,
'#skF_2': state ).
tff('#skF_3',type,
'#skF_3': state ).
tff('#skF_1',type,
'#skF_1': state ).
tff(induct_false,type,
induct_false: $o ).
tff(induct_true,type,
induct_true: $o ).
tff(f_47,negated_conjecture,
~ ! [T: state] :
~ ! [S: state] : ( S = T ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f_42,hypothesis,
hoare_1310879719gleton,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f_36,axiom,
( hoare_1310879719gleton
<=> ? [S: state,T: state] : ( S != T ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).
tff(c_23,plain,
'#skF_3' = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_19,plain,
! [S_5: state] : ( S_5 = '#skF_3' ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_28,plain,
! [S_15: state] : ( S_15 = '#skF_1' ),
inference(superposition,[status(thm),theory(equality)],[c_23,c_19]) ).
tff(c_12,plain,
hoare_1310879719gleton,
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_4,plain,
( ( '#skF_2' != '#skF_1' )
| ~ hoare_1310879719gleton ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_17,plain,
'#skF_2' != '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_12,c_4]) ).
tff(c_34,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_28,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW469_1 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.35 % Computer : n017.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 19:02:51 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.96/1.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.96/1.84
% 2.96/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/1.86
% 3.01/1.86 Inference rules
% 3.01/1.86 ----------------------
% 3.01/1.86 #Ref : 0
% 3.01/1.86 #Sup : 5
% 3.01/1.86 #Fact : 0
% 3.01/1.86 #Define : 0
% 3.01/1.86 #Split : 0
% 3.01/1.86 #Chain : 0
% 3.01/1.86 #Close : 0
% 3.01/1.86
% 3.01/1.86 Ordering : KBO
% 3.01/1.86
% 3.01/1.86 Simplification rules
% 3.01/1.86 ----------------------
% 3.01/1.86 #Subsume : 0
% 3.01/1.86 #Demod : 3
% 3.01/1.86 #Tautology : 2
% 3.01/1.86 #SimpNegUnit : 0
% 3.01/1.86 #BackRed : 0
% 3.01/1.86
% 3.01/1.86 #Partial instantiations: 7
% 3.01/1.86 #Strategies tried : 1
% 3.01/1.86
% 3.01/1.86 Timing (in seconds)
% 3.01/1.86 ----------------------
% 3.01/1.87 Preprocessing : 0.55
% 3.01/1.87 Parsing : 0.32
% 3.01/1.87 CNF conversion : 0.03
% 3.01/1.87 Main loop : 0.11
% 3.01/1.87 Inferencing : 0.05
% 3.01/1.87 Reduction : 0.02
% 3.01/1.87 Demodulation : 0.02
% 3.01/1.87 BG Simplification : 0.01
% 3.01/1.87 Subsumption : 0.02
% 3.01/1.87 Abstraction : 0.01
% 3.01/1.87 MUC search : 0.00
% 3.01/1.87 Cooper : 0.00
% 3.01/1.87 Total : 0.70
% 3.01/1.87 Index Insertion : 0.00
% 3.01/1.87 Index Deletion : 0.00
% 3.01/1.87 Index Matching : 0.00
% 3.01/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------