TSTP Solution File: SWV392+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV392+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/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 : 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 11:03:59 EDT 2023
% Result : Theorem 2.74s 1.60s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 17
% Syntax : Number of formulae : 20 ( 4 unt; 15 typ; 0 def)
% Number of atoms : 8 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 10 >; 10 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > strictly_less_than > less_than > contains_slb > isnonempty_slb > update_slb > remove_slb > pair > lookup_slb > insert_slb > #nlpp > create_slb > bottom > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(create_slb,type,
create_slb: $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_113,axiom,
! [U,V] : ~ pair_in_list(create_slb,U,V),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax22) ).
tff(f_165,negated_conjecture,
~ ! [U,V] :
( pair_in_list(create_slb,U,V)
=> ! [W] :
( contains_slb(create_slb,W)
=> ( pair_in_list(remove_slb(create_slb,W),U,V)
| ( U = W ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_co) ).
tff(c_28,plain,
! [U_18,V_19] : ~ pair_in_list(create_slb,U_18,V_19),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_58,plain,
pair_in_list(create_slb,'#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_165]) ).
tff(c_59,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV392+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % 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.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu Aug 3 23:14:01 EDT 2023
% 0.11/0.32 % CPUTime :
% 2.74/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.60
% 2.74/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.88/1.62
% 2.88/1.62 Inference rules
% 2.88/1.62 ----------------------
% 2.88/1.62 #Ref : 0
% 2.88/1.62 #Sup : 0
% 2.88/1.62 #Fact : 0
% 2.88/1.62 #Define : 0
% 2.88/1.62 #Split : 0
% 2.88/1.62 #Chain : 0
% 2.88/1.62 #Close : 0
% 2.88/1.62
% 2.88/1.62 Ordering : KBO
% 2.88/1.62
% 2.88/1.62 Simplification rules
% 2.88/1.62 ----------------------
% 2.88/1.62 #Subsume : 28
% 2.88/1.62 #Demod : 0
% 2.88/1.62 #Tautology : 0
% 2.88/1.62 #SimpNegUnit : 1
% 2.88/1.62 #BackRed : 0
% 2.88/1.62
% 2.88/1.62 #Partial instantiations: 0
% 2.88/1.62 #Strategies tried : 1
% 2.88/1.62
% 2.88/1.62 Timing (in seconds)
% 2.88/1.62 ----------------------
% 2.88/1.62 Preprocessing : 0.54
% 2.88/1.62 Parsing : 0.27
% 2.88/1.62 CNF conversion : 0.03
% 2.88/1.62 Main loop : 0.08
% 2.88/1.63 Inferencing : 0.00
% 2.88/1.63 Reduction : 0.04
% 2.88/1.63 Demodulation : 0.03
% 2.88/1.63 BG Simplification : 0.02
% 2.88/1.63 Subsumption : 0.03
% 2.88/1.63 Abstraction : 0.01
% 2.88/1.63 MUC search : 0.00
% 2.88/1.63 Cooper : 0.00
% 2.88/1.63 Total : 0.65
% 2.88/1.63 Index Insertion : 0.00
% 2.88/1.63 Index Deletion : 0.00
% 2.88/1.63 Index Matching : 0.00
% 2.88/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------