TSTP Solution File: SWV388+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV388+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 : n002.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 3.90s 1.92s
% Output : CNFRefutation 3.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 32
% Syntax : Number of formulae : 37 ( 4 unt; 30 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 8 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 42 ( 24 >; 18 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 21 ( 21 usr; 6 con; 0-3 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > less_than > contains_slb > contains_cpq > ok > isnonempty_slb > check_cpq > triple > update_slb > remove_slb > remove_pqp > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_cpq > #nlpp > removemin_cpq_res > removemin_cpq_eff > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > bottom > bad > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
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(contains_cpq,type,
contains_cpq: ( $i * $i ) > $o ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(ok,type,
ok: $i > $o ).
tff(insert_pqp,type,
insert_pqp: ( $i * $i ) > $i ).
tff(findmin_pqp_res,type,
findmin_pqp_res: $i > $i ).
tff(remove_pqp,type,
remove_pqp: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(check_cpq,type,
check_cpq: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(findmin_cpq_eff,type,
findmin_cpq_eff: $i > $i ).
tff(removemin_cpq_eff,type,
removemin_cpq_eff: $i > $i ).
tff(create_slb,type,
create_slb: $i ).
tff(findmin_cpq_res,type,
findmin_cpq_res: $i > $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_303,negated_conjecture,
~ ! [U,V,W] :
( ~ check_cpq(triple(U,V,W))
=> ( ~ check_cpq(findmin_cpq_eff(triple(U,V,W)))
| ~ ok(findmin_cpq_eff(triple(U,V,W))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l24_co) ).
tff(f_292,lemma,
! [U,V,W] :
( ~ check_cpq(triple(U,V,W))
=> ~ check_cpq(findmin_cpq_eff(triple(U,V,W))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l24_l34) ).
tff(c_108,plain,
~ check_cpq(triple('#skF_1','#skF_2','#skF_3')),
inference(cnfTransformation,[status(thm)],[f_303]) ).
tff(c_106,plain,
check_cpq(findmin_cpq_eff(triple('#skF_1','#skF_2','#skF_3'))),
inference(cnfTransformation,[status(thm)],[f_303]) ).
tff(c_390,plain,
! [U_202,V_203,W_204] :
( ~ check_cpq(findmin_cpq_eff(triple(U_202,V_203,W_204)))
| check_cpq(triple(U_202,V_203,W_204)) ),
inference(cnfTransformation,[status(thm)],[f_292]) ).
tff(c_396,plain,
check_cpq(triple('#skF_1','#skF_2','#skF_3')),
inference(resolution,[status(thm)],[c_106,c_390]) ).
tff(c_402,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_108,c_396]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV388+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/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.13/0.34 % Computer : n002.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 22:47:31 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.90/1.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.90/1.92
% 3.90/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.90/1.94
% 3.90/1.94 Inference rules
% 3.90/1.94 ----------------------
% 3.90/1.94 #Ref : 0
% 3.90/1.94 #Sup : 50
% 3.90/1.94 #Fact : 8
% 3.90/1.94 #Define : 0
% 3.90/1.94 #Split : 0
% 3.90/1.94 #Chain : 0
% 3.90/1.94 #Close : 0
% 3.90/1.94
% 3.90/1.94 Ordering : KBO
% 3.90/1.94
% 3.90/1.94 Simplification rules
% 3.90/1.94 ----------------------
% 3.90/1.94 #Subsume : 4
% 3.90/1.94 #Demod : 19
% 3.90/1.94 #Tautology : 39
% 3.90/1.94 #SimpNegUnit : 1
% 3.90/1.94 #BackRed : 0
% 3.90/1.94
% 3.90/1.94 #Partial instantiations: 0
% 3.90/1.94 #Strategies tried : 1
% 3.90/1.94
% 3.90/1.94 Timing (in seconds)
% 3.90/1.94 ----------------------
% 3.90/1.94 Preprocessing : 0.61
% 3.90/1.94 Parsing : 0.31
% 3.90/1.94 CNF conversion : 0.04
% 3.90/1.94 Main loop : 0.30
% 3.90/1.94 Inferencing : 0.10
% 3.90/1.94 Reduction : 0.10
% 3.90/1.94 Demodulation : 0.07
% 3.90/1.94 BG Simplification : 0.03
% 3.90/1.94 Subsumption : 0.07
% 3.90/1.94 Abstraction : 0.02
% 3.90/1.94 MUC search : 0.00
% 3.90/1.94 Cooper : 0.00
% 3.90/1.94 Total : 0.95
% 3.90/1.94 Index Insertion : 0.00
% 3.90/1.94 Index Deletion : 0.00
% 3.90/1.94 Index Matching : 0.00
% 3.90/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------