TSTP Solution File: SWV369+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV369+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 : n025.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:55 EDT 2023
% Result : Theorem 4.56s 2.10s
% Output : CNFRefutation 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 60
% Syntax : Number of formulae : 69 ( 9 unt; 55 typ; 0 def)
% Number of atoms : 19 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 45 >; 31 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 36 ( 36 usr; 10 con; 0-3 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > pi_sharp_removemin > pi_sharp_remove > pi_sharp_find_min > pi_remove > less_than > issmallestelement_pq > contains_slb > contains_pq > contains_cpq > pi_removemin > pi_find_min > phi > ok > isnonempty_slb > isnonempty_pq > check_cpq > triple > update_slb > removemin_pq_res > removemin_pq_eff > remove_slb > remove_pqp > remove_pq > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_pq > insert_cpq > findmin_pq_res > findmin_pq_eff > #nlpp > removemin_cpq_res > removemin_cpq_eff > i > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > create_pq > bottom > bad > #skF_2 > #skF_4 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_9 > #skF_8 > #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(pi_sharp_find_min,type,
pi_sharp_find_min: ( $i * $i ) > $o ).
tff(pi_remove,type,
pi_remove: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(insert_pq,type,
insert_pq: ( $i * $i ) > $i ).
tff(pi_find_min,type,
pi_find_min: $i > $o ).
tff(i,type,
i: $i > $i ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_removemin,type,
pi_sharp_removemin: ( $i * $i ) > $o ).
tff(pi_sharp_remove,type,
pi_sharp_remove: ( $i * $i ) > $o ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(contains_pq,type,
contains_pq: ( $i * $i ) > $o ).
tff(findmin_pq_eff,type,
findmin_pq_eff: ( $i * $i ) > $i ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pi_removemin,type,
pi_removemin: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(phi,type,
phi: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(isnonempty_pq,type,
isnonempty_pq: $i > $o ).
tff(findmin_pq_res,type,
findmin_pq_res: ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(issmallestelement_pq,type,
issmallestelement_pq: ( $i * $i ) > $o ).
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('#skF_9',type,
'#skF_9': $i ).
tff(remove_pq,type,
remove_pq: ( $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(removemin_pq_res,type,
removemin_pq_res: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(create_pq,type,
create_pq: $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff('#skF_3',type,
'#skF_3': $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(removemin_pq_eff,type,
removemin_pq_eff: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $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_185,axiom,
! [U] : ~ contains_slb(create_slb,U),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
tff(f_104,axiom,
! [U] : ~ contains_pq(create_pq,U),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax8) ).
tff(f_389,axiom,
! [U,V] : ( i(triple(U,create_slb,V)) = create_pq ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax54) ).
tff(f_442,negated_conjecture,
~ ! [U,V,W] :
( contains_cpq(triple(U,create_slb,V),W)
<=> contains_pq(i(triple(U,create_slb,V)),W) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l5_co) ).
tff(f_295,axiom,
! [U,V,W,X] :
( contains_cpq(triple(U,V,W),X)
<=> contains_slb(V,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
tff(c_52,plain,
! [U_40] : ~ contains_slb(create_slb,U_40),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_20,plain,
! [U_12] : ~ contains_pq(create_pq,U_12),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_134,plain,
! [U_145,V_146] : ( i(triple(U_145,create_slb,V_146)) = create_pq ),
inference(cnfTransformation,[status(thm)],[f_389]) ).
tff(c_180,plain,
( contains_pq(i(triple('#skF_5',create_slb,'#skF_6')),'#skF_7')
| contains_cpq(triple('#skF_8',create_slb,'#skF_9'),'#skF_10') ),
inference(cnfTransformation,[status(thm)],[f_442]) ).
tff(c_183,plain,
( contains_pq(create_pq,'#skF_7')
| contains_cpq(triple('#skF_8',create_slb,'#skF_9'),'#skF_10') ),
inference(demodulation,[status(thm),theory(equality)],[c_134,c_180]) ).
tff(c_185,plain,
contains_cpq(triple('#skF_8',create_slb,'#skF_9'),'#skF_10'),
inference(negUnitSimplification,[status(thm)],[c_20,c_183]) ).
tff(c_641,plain,
! [V_313,X_314,U_315,W_316] :
( contains_slb(V_313,X_314)
| ~ contains_cpq(triple(U_315,V_313,W_316),X_314) ),
inference(cnfTransformation,[status(thm)],[f_295]) ).
tff(c_647,plain,
contains_slb(create_slb,'#skF_10'),
inference(resolution,[status(thm)],[c_185,c_641]) ).
tff(c_652,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_52,c_647]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV369+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 : n025.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:19:05 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.56/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.56/2.11
% 4.56/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.56/2.13
% 4.56/2.13 Inference rules
% 4.56/2.13 ----------------------
% 4.56/2.13 #Ref : 0
% 4.56/2.13 #Sup : 93
% 4.56/2.13 #Fact : 2
% 4.56/2.13 #Define : 0
% 4.56/2.13 #Split : 0
% 4.56/2.13 #Chain : 0
% 4.56/2.13 #Close : 0
% 4.56/2.13
% 4.56/2.13 Ordering : KBO
% 4.56/2.13
% 4.56/2.13 Simplification rules
% 4.56/2.13 ----------------------
% 4.56/2.13 #Subsume : 10
% 4.56/2.13 #Demod : 14
% 4.56/2.13 #Tautology : 43
% 4.56/2.13 #SimpNegUnit : 9
% 4.56/2.13 #BackRed : 0
% 4.56/2.13
% 4.56/2.13 #Partial instantiations: 0
% 4.56/2.13 #Strategies tried : 1
% 4.56/2.13
% 4.56/2.13 Timing (in seconds)
% 4.56/2.13 ----------------------
% 4.56/2.13 Preprocessing : 0.67
% 4.56/2.14 Parsing : 0.34
% 4.56/2.14 CNF conversion : 0.05
% 4.56/2.14 Main loop : 0.40
% 4.56/2.14 Inferencing : 0.13
% 4.56/2.14 Reduction : 0.13
% 4.56/2.14 Demodulation : 0.09
% 4.56/2.14 BG Simplification : 0.04
% 4.56/2.14 Subsumption : 0.08
% 4.56/2.14 Abstraction : 0.02
% 4.56/2.14 MUC search : 0.00
% 4.56/2.14 Cooper : 0.00
% 4.56/2.14 Total : 1.11
% 4.56/2.14 Index Insertion : 0.00
% 4.56/2.14 Index Deletion : 0.00
% 4.56/2.14 Index Matching : 0.00
% 4.56/2.14 BG Taut test : 0.00
%------------------------------------------------------------------------------