TSTP Solution File: PUZ149_13 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ149_13 : TPTP v8.2.0. Released v8.2.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 : n028.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 10:54:18 EDT 2023
% Result : Theorem 3.15s 1.79s
% Output : CNFRefutation 3.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 19
% Syntax : Number of formulae : 49 ( 18 unt; 15 typ; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 65 ( 36 ~; 19 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 23 ( 23 fml; 0 var)
% Number of types : 3 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 22 (; 18 !; 4 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
%$ acid > #nlpp > #idx(pour_b) > #idx(pour_a) > #idx(make_c) > #skF_9 > #skF_5 > #skF_7 > #skF_8 > #skF_6 > #skF_4 > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
tff($ki_index,type,
$ki_index: $tType ).
tff($ki_world,type,
$ki_world: $tType ).
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $ki_world ).
tff('#skF_5',type,
'#skF_5': $ki_world ).
tff(acid,type,
acid: $ki_world > $o ).
tff('#skF_7',type,
'#skF_7': $ki_world ).
tff('#idx(pour_b)',type,
'#idx(pour_b)': $ki_index ).
tff('#idx(make_c)',type,
'#idx(make_c)': $ki_index ).
tff('#skF_8',type,
'#skF_8': $ki_world ).
tff('#skF_6',type,
'#skF_6': $ki_world ).
tff('#skF_4',type,
'#skF_4': $ki_world ).
tff('#skF_2',type,
'#skF_2': $ki_world ).
tff('#idx(pour_a)',type,
'#idx(pour_a)': $ki_index ).
tff('#skF_1',type,
'#skF_1': $ki_world ).
tff('#skF_3',type,
'#skF_3': $ki_world ).
tff(f_94,axiom,
? [W: $ki_world] :
( $ki_accessible('#idx(make_c)',$ki_local_world,W)
& acid(W) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',make_c_acid) ).
tff(f_59,axiom,
( ! [W: $ki_world] :
( $ki_accessible('#idx(pour_a)',$ki_local_world,W)
=> ! [W0: $ki_world] :
( $ki_accessible('#idx(pour_b)',W,W0)
=> ~ acid(W0) ) )
=> ! [W: $ki_world] :
( $ki_accessible('#idx(make_c)',$ki_local_world,W)
=> ~ acid(W) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pour_ab_make_axiom_2) ).
tff(f_108,negated_conjecture,
~ ( ? [W: $ki_world] :
( $ki_accessible('#idx(pour_a)',$ki_local_world,W)
& ~ acid(W) )
& ? [W: $ki_world] :
( $ki_accessible('#idx(pour_a)',$ki_local_world,W)
& ? [W0: $ki_world] :
( $ki_accessible('#idx(pour_b)',W,W0)
& acid(W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f_90,axiom,
! [W: $ki_world] :
( $ki_accessible('#idx(pour_a)',$ki_local_world,W)
=> ~ acid(W) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pour_a_acid) ).
tff(c_28,plain,
acid('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_30,plain,
$ki_accessible('#idx(make_c)',$ki_local_world,'#skF_9'),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_12,plain,
! [W_4: $ki_world] :
( $ki_accessible('#idx(pour_a)',$ki_local_world,'#skF_3')
| ~ acid(W_4)
| ~ $ki_accessible('#idx(make_c)',$ki_local_world,W_4) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_131,plain,
! [W_25: $ki_world] :
( ~ acid(W_25)
| ~ $ki_accessible('#idx(make_c)',$ki_local_world,W_25) ),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_134,plain,
~ acid('#skF_9'),
inference(resolution,[status(thm)],[c_30,c_131]) ).
tff(c_138,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_134]) ).
tff(c_139,plain,
$ki_accessible('#idx(pour_a)',$ki_local_world,'#skF_3'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_58,plain,
! [W_17: $ki_world] :
( ~ acid(W_17)
| ~ $ki_accessible('#idx(make_c)',$ki_local_world,W_17) ),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_61,plain,
~ acid('#skF_9'),
inference(resolution,[status(thm)],[c_30,c_58]) ).
tff(c_65,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_61]) ).
tff(c_66,plain,
$ki_accessible('#idx(pour_a)',$ki_local_world,'#skF_3'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_8,plain,
! [W_4: $ki_world] :
( acid('#skF_4')
| ~ acid(W_4)
| ~ $ki_accessible('#idx(make_c)',$ki_local_world,W_4) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_37,plain,
! [W_15: $ki_world] :
( ~ acid(W_15)
| ~ $ki_accessible('#idx(make_c)',$ki_local_world,W_15) ),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_40,plain,
~ acid('#skF_9'),
inference(resolution,[status(thm)],[c_30,c_37]) ).
tff(c_44,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_40]) ).
tff(c_45,plain,
acid('#skF_4'),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_10,plain,
! [W_4: $ki_world] :
( $ki_accessible('#idx(pour_b)','#skF_3','#skF_4')
| ~ acid(W_4)
| ~ $ki_accessible('#idx(make_c)',$ki_local_world,W_4) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_78,plain,
! [W_20: $ki_world] :
( ~ acid(W_20)
| ~ $ki_accessible('#idx(make_c)',$ki_local_world,W_20) ),
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_81,plain,
~ acid('#skF_9'),
inference(resolution,[status(thm)],[c_30,c_78]) ).
tff(c_85,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_81]) ).
tff(c_86,plain,
$ki_accessible('#idx(pour_b)','#skF_3','#skF_4'),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_32,plain,
! [W0_13: $ki_world,W_11: $ki_world,W_10: $ki_world] :
( ~ acid(W0_13)
| ~ $ki_accessible('#idx(pour_b)',W_11,W0_13)
| ~ $ki_accessible('#idx(pour_a)',$ki_local_world,W_11)
| acid(W_10)
| ~ $ki_accessible('#idx(pour_a)',$ki_local_world,W_10) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_46,plain,
! [W0_13: $ki_world,W_11: $ki_world] :
( ~ acid(W0_13)
| ~ $ki_accessible('#idx(pour_b)',W_11,W0_13)
| ~ $ki_accessible('#idx(pour_a)',$ki_local_world,W_11) ),
inference(splitLeft,[status(thm)],[c_32]) ).
tff(c_89,plain,
( ~ acid('#skF_4')
| ~ $ki_accessible('#idx(pour_a)',$ki_local_world,'#skF_3') ),
inference(resolution,[status(thm)],[c_86,c_46]) ).
tff(c_93,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_66,c_45,c_89]) ).
tff(c_94,plain,
! [W_10: $ki_world] :
( acid(W_10)
| ~ $ki_accessible('#idx(pour_a)',$ki_local_world,W_10) ),
inference(splitRight,[status(thm)],[c_32]) ).
tff(c_146,plain,
acid('#skF_3'),
inference(resolution,[status(thm)],[c_139,c_94]) ).
tff(c_26,plain,
! [W_9: $ki_world] :
( ~ acid(W_9)
| ~ $ki_accessible('#idx(pour_a)',$ki_local_world,W_9) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_147,plain,
~ acid('#skF_3'),
inference(resolution,[status(thm)],[c_139,c_26]) ).
tff(c_150,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_146,c_147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PUZ149_13 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.15 % 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 : n028.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 17:51:39 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.15/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.15/1.79
% 3.15/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.15/1.82
% 3.15/1.82 Inference rules
% 3.15/1.82 ----------------------
% 3.15/1.82 #Ref : 0
% 3.15/1.82 #Sup : 13
% 3.15/1.82 #Fact : 0
% 3.15/1.82 #Define : 0
% 3.15/1.82 #Split : 17
% 3.15/1.82 #Chain : 0
% 3.15/1.82 #Close : 0
% 3.15/1.82
% 3.15/1.82 Ordering : KBO
% 3.15/1.82
% 3.15/1.82 Simplification rules
% 3.15/1.82 ----------------------
% 3.15/1.82 #Subsume : 1
% 3.15/1.82 #Demod : 11
% 3.15/1.82 #Tautology : 0
% 3.15/1.82 #SimpNegUnit : 0
% 3.15/1.82 #BackRed : 0
% 3.15/1.82
% 3.15/1.82 #Partial instantiations: 0
% 3.15/1.82 #Strategies tried : 1
% 3.15/1.82
% 3.15/1.82 Timing (in seconds)
% 3.15/1.82 ----------------------
% 3.15/1.82 Preprocessing : 0.51
% 3.15/1.82 Parsing : 0.30
% 3.15/1.82 CNF conversion : 0.03
% 3.15/1.82 Main loop : 0.25
% 3.15/1.82 Inferencing : 0.10
% 3.15/1.82 Reduction : 0.06
% 3.15/1.82 Demodulation : 0.04
% 3.15/1.82 BG Simplification : 0.02
% 3.15/1.82 Subsumption : 0.05
% 3.15/1.82 Abstraction : 0.01
% 3.15/1.82 MUC search : 0.00
% 3.15/1.82 Cooper : 0.00
% 3.15/1.82 Total : 0.80
% 3.15/1.82 Index Insertion : 0.00
% 3.15/1.82 Index Deletion : 0.00
% 3.15/1.82 Index Matching : 0.00
% 3.15/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------