TSTP Solution File: SWV408+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV408+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 : n013.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:04:02 EDT 2023
% Result : Theorem 8.51s 3.11s
% Output : CNFRefutation 8.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 37
% Syntax : Number of formulae : 56 ( 14 unt; 32 typ; 0 def)
% Number of atoms : 48 ( 6 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 42 ( 18 ~; 17 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 25 >; 20 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 7 con; 0-3 aty)
% Number of variables : 28 (; 26 !; 2 ?; 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_1 > #skF_5 > #skF_2 > #skF_3 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $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('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $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('#skF_4',type,
'#skF_4': $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_307,negated_conjecture,
~ ! [U,V,W,X] :
( ( contains_slb(V,X)
& strictly_less_than(X,findmin_cpq_res(triple(U,V,W))) )
=> ( pair_in_list(update_slb(V,findmin_pqp_res(U)),X,findmin_pqp_res(U))
| ? [Y] :
( pair_in_list(update_slb(V,findmin_pqp_res(U)),X,Y)
& less_than(findmin_pqp_res(U),Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l44_co) ).
tff(f_276,axiom,
! [U,V,W,X] :
( ( V != create_slb )
=> ( findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
tff(f_104,axiom,
! [U] : ~ contains_slb(create_slb,U),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
tff(f_62,axiom,
! [U] : less_than(U,U),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',reflexivity) ).
tff(f_294,lemma,
! [U,V,W] :
( ( contains_slb(U,V)
& strictly_less_than(V,W) )
=> ( pair_in_list(update_slb(U,W),V,W)
| ? [X] :
( pair_in_list(update_slb(U,W),V,X)
& less_than(W,X) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l44_l45) ).
tff(c_108,plain,
~ pair_in_list(update_slb('#skF_3',findmin_pqp_res('#skF_2')),'#skF_5',findmin_pqp_res('#skF_2')),
inference(cnfTransformation,[status(thm)],[f_307]) ).
tff(c_112,plain,
contains_slb('#skF_3','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_307]) ).
tff(c_261,plain,
! [U_188,V_189,W_190] :
( ( findmin_cpq_res(triple(U_188,V_189,W_190)) = findmin_pqp_res(U_188) )
| ( create_slb = V_189 ) ),
inference(cnfTransformation,[status(thm)],[f_276]) ).
tff(c_110,plain,
strictly_less_than('#skF_5',findmin_cpq_res(triple('#skF_2','#skF_3','#skF_4'))),
inference(cnfTransformation,[status(thm)],[f_307]) ).
tff(c_280,plain,
( strictly_less_than('#skF_5',findmin_pqp_res('#skF_2'))
| ( create_slb = '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_261,c_110]) ).
tff(c_291,plain,
create_slb = '#skF_3',
inference(splitLeft,[status(thm)],[c_280]) ).
tff(c_20,plain,
! [U_13] : ~ contains_slb(create_slb,U_13),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_298,plain,
! [U_13] : ~ contains_slb('#skF_3',U_13),
inference(demodulation,[status(thm),theory(equality)],[c_291,c_20]) ).
tff(c_305,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_298,c_112]) ).
tff(c_306,plain,
strictly_less_than('#skF_5',findmin_pqp_res('#skF_2')),
inference(splitRight,[status(thm)],[c_280]) ).
tff(c_6,plain,
! [U_6] : less_than(U_6,U_6),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_3869,plain,
! [W_421,U_422,V_423] :
( less_than(W_421,'#skF_1'(U_422,V_423,W_421))
| pair_in_list(update_slb(U_422,W_421),V_423,W_421)
| ~ strictly_less_than(V_423,W_421)
| ~ contains_slb(U_422,V_423) ),
inference(cnfTransformation,[status(thm)],[f_294]) ).
tff(c_106,plain,
! [Y_123] :
( ~ less_than(findmin_pqp_res('#skF_2'),Y_123)
| ~ pair_in_list(update_slb('#skF_3',findmin_pqp_res('#skF_2')),'#skF_5',Y_123) ),
inference(cnfTransformation,[status(thm)],[f_307]) ).
tff(c_3873,plain,
( ~ less_than(findmin_pqp_res('#skF_2'),findmin_pqp_res('#skF_2'))
| less_than(findmin_pqp_res('#skF_2'),'#skF_1'('#skF_3','#skF_5',findmin_pqp_res('#skF_2')))
| ~ strictly_less_than('#skF_5',findmin_pqp_res('#skF_2'))
| ~ contains_slb('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_3869,c_106]) ).
tff(c_3888,plain,
less_than(findmin_pqp_res('#skF_2'),'#skF_1'('#skF_3','#skF_5',findmin_pqp_res('#skF_2'))),
inference(demodulation,[status(thm),theory(equality)],[c_112,c_306,c_6,c_3873]) ).
tff(c_5698,plain,
! [U_459,W_460,V_461] :
( pair_in_list(update_slb(U_459,W_460),V_461,'#skF_1'(U_459,V_461,W_460))
| pair_in_list(update_slb(U_459,W_460),V_461,W_460)
| ~ strictly_less_than(V_461,W_460)
| ~ contains_slb(U_459,V_461) ),
inference(cnfTransformation,[status(thm)],[f_294]) ).
tff(c_5702,plain,
( ~ less_than(findmin_pqp_res('#skF_2'),'#skF_1'('#skF_3','#skF_5',findmin_pqp_res('#skF_2')))
| pair_in_list(update_slb('#skF_3',findmin_pqp_res('#skF_2')),'#skF_5',findmin_pqp_res('#skF_2'))
| ~ strictly_less_than('#skF_5',findmin_pqp_res('#skF_2'))
| ~ contains_slb('#skF_3','#skF_5') ),
inference(resolution,[status(thm)],[c_5698,c_106]) ).
tff(c_5714,plain,
pair_in_list(update_slb('#skF_3',findmin_pqp_res('#skF_2')),'#skF_5',findmin_pqp_res('#skF_2')),
inference(demodulation,[status(thm),theory(equality)],[c_112,c_306,c_3888,c_5702]) ).
tff(c_5716,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_108,c_5714]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV408+1 : TPTP v8.1.2. Released v3.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.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 23:03:18 EDT 2023
% 0.14/0.36 % CPUTime :
% 8.51/3.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.55/3.12
% 8.55/3.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.55/3.14
% 8.55/3.14 Inference rules
% 8.55/3.14 ----------------------
% 8.55/3.14 #Ref : 0
% 8.55/3.14 #Sup : 1339
% 8.55/3.14 #Fact : 64
% 8.55/3.14 #Define : 0
% 8.55/3.14 #Split : 3
% 8.55/3.14 #Chain : 0
% 8.55/3.14 #Close : 0
% 8.55/3.15
% 8.55/3.15 Ordering : KBO
% 8.55/3.15
% 8.55/3.15 Simplification rules
% 8.55/3.15 ----------------------
% 8.55/3.15 #Subsume : 627
% 8.55/3.15 #Demod : 480
% 8.55/3.15 #Tautology : 316
% 8.55/3.15 #SimpNegUnit : 25
% 8.55/3.15 #BackRed : 10
% 8.55/3.15
% 8.55/3.15 #Partial instantiations: 0
% 8.55/3.15 #Strategies tried : 1
% 8.55/3.15
% 8.55/3.15 Timing (in seconds)
% 8.55/3.15 ----------------------
% 8.55/3.15 Preprocessing : 0.78
% 8.55/3.15 Parsing : 0.39
% 8.55/3.15 CNF conversion : 0.06
% 8.55/3.15 Main loop : 1.24
% 8.55/3.15 Inferencing : 0.39
% 8.55/3.15 Reduction : 0.39
% 8.55/3.15 Demodulation : 0.28
% 8.55/3.15 BG Simplification : 0.05
% 8.55/3.15 Subsumption : 0.34
% 8.55/3.15 Abstraction : 0.05
% 8.55/3.15 MUC search : 0.00
% 8.55/3.15 Cooper : 0.00
% 8.55/3.15 Total : 2.06
% 8.55/3.15 Index Insertion : 0.00
% 8.55/3.15 Index Deletion : 0.00
% 8.55/3.15 Index Matching : 0.00
% 8.55/3.15 BG Taut test : 0.00
%------------------------------------------------------------------------------