TSTP Solution File: SWV383+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV383+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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:58 EDT 2023
% Result : Theorem 5.70s 2.53s
% Output : CNFRefutation 6.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 35
% Syntax : Number of formulae : 43 ( 6 unt; 33 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 26 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 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 : 24 ( 24 usr; 9 con; 0-3 aty)
% Number of variables : 18 (; 18 !; 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_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%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('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
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('#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_312,negated_conjecture,
~ ! [U,V,W] :
( ~ check_cpq(triple(U,V,W))
=> ! [X,Y,Z] :
( succ_cpq(triple(U,V,W),triple(X,Y,Z))
=> ( ~ ok(triple(X,Y,Z))
| ~ check_cpq(triple(X,Y,Z)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_co) ).
tff(f_298,lemma,
! [U,V,W] :
( ( ~ check_cpq(triple(U,V,W))
| ~ ok(triple(U,V,W)) )
=> ! [X,Y,Z] :
( succ_cpq(triple(U,V,W),triple(X,Y,Z))
=> ( ~ ok(triple(X,Y,Z))
| ~ check_cpq(triple(X,Y,Z)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_l20) ).
tff(c_112,plain,
~ check_cpq(triple('#skF_1','#skF_2','#skF_3')),
inference(cnfTransformation,[status(thm)],[f_312]) ).
tff(c_108,plain,
ok(triple('#skF_4','#skF_5','#skF_6')),
inference(cnfTransformation,[status(thm)],[f_312]) ).
tff(c_106,plain,
check_cpq(triple('#skF_4','#skF_5','#skF_6')),
inference(cnfTransformation,[status(thm)],[f_312]) ).
tff(c_110,plain,
succ_cpq(triple('#skF_1','#skF_2','#skF_3'),triple('#skF_4','#skF_5','#skF_6')),
inference(cnfTransformation,[status(thm)],[f_312]) ).
tff(c_1706,plain,
! [X_446,W_447,V_444,U_445,Y_449,Z_448] :
( check_cpq(triple(U_445,V_444,W_447))
| ~ check_cpq(triple(X_446,Y_449,Z_448))
| ~ ok(triple(X_446,Y_449,Z_448))
| ~ succ_cpq(triple(U_445,V_444,W_447),triple(X_446,Y_449,Z_448)) ),
inference(cnfTransformation,[status(thm)],[f_298]) ).
tff(c_1742,plain,
( check_cpq(triple('#skF_1','#skF_2','#skF_3'))
| ~ check_cpq(triple('#skF_4','#skF_5','#skF_6'))
| ~ ok(triple('#skF_4','#skF_5','#skF_6')) ),
inference(resolution,[status(thm)],[c_110,c_1706]) ).
tff(c_1757,plain,
check_cpq(triple('#skF_1','#skF_2','#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_106,c_1742]) ).
tff(c_1759,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_112,c_1757]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV383+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 23:24:01 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.70/2.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.70/2.54
% 5.70/2.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.10/2.56
% 6.10/2.56 Inference rules
% 6.10/2.56 ----------------------
% 6.10/2.56 #Ref : 0
% 6.10/2.56 #Sup : 391
% 6.10/2.56 #Fact : 20
% 6.10/2.56 #Define : 0
% 6.10/2.56 #Split : 1
% 6.10/2.56 #Chain : 0
% 6.10/2.56 #Close : 0
% 6.10/2.56
% 6.10/2.56 Ordering : KBO
% 6.10/2.56
% 6.10/2.56 Simplification rules
% 6.10/2.56 ----------------------
% 6.10/2.56 #Subsume : 79
% 6.10/2.56 #Demod : 98
% 6.10/2.56 #Tautology : 129
% 6.10/2.56 #SimpNegUnit : 15
% 6.10/2.56 #BackRed : 1
% 6.10/2.56
% 6.10/2.56 #Partial instantiations: 0
% 6.10/2.56 #Strategies tried : 1
% 6.10/2.56
% 6.10/2.56 Timing (in seconds)
% 6.10/2.56 ----------------------
% 6.10/2.56 Preprocessing : 0.72
% 6.10/2.56 Parsing : 0.37
% 6.10/2.56 CNF conversion : 0.05
% 6.10/2.56 Main loop : 0.69
% 6.10/2.56 Inferencing : 0.26
% 6.10/2.56 Reduction : 0.22
% 6.10/2.56 Demodulation : 0.14
% 6.10/2.56 BG Simplification : 0.04
% 6.10/2.56 Subsumption : 0.14
% 6.10/2.56 Abstraction : 0.03
% 6.10/2.57 MUC search : 0.00
% 6.10/2.57 Cooper : 0.00
% 6.10/2.57 Total : 1.45
% 6.10/2.57 Index Insertion : 0.00
% 6.10/2.57 Index Deletion : 0.00
% 6.10/2.57 Index Matching : 0.00
% 6.10/2.57 BG Taut test : 0.00
%------------------------------------------------------------------------------