TSTP Solution File: NLP267_4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NLP267_4 : 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/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 : n012.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:50:49 EDT 2023
% Result : Theorem 3.19s 1.82s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 27 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 30 ( 16 ~; 8 |; 1 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 11 ( 11 fml; 0 var)
% Number of types : 3 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 7 (; 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ price > dest > class > #nlpp > seventy > second > paris > ninetyfive > first > #skF_1
%Foreground sorts:
tff($ki_world,type,
$ki_world: $tType ).
%Background operators:
%Foreground operators:
tff(dest,type,
dest: ( $ki_world * $i ) > $o ).
tff(second,type,
second: $i ).
tff(paris,type,
paris: $i ).
tff(first,type,
first: $i ).
tff(seventy,type,
seventy: $i ).
tff(ninetyfive,type,
ninetyfive: $i ).
tff(price,type,
price: ( $ki_world * $i ) > $o ).
tff(class,type,
class: ( $ki_world * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $ki_world ).
tff(f_79,negated_conjecture,
~ ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> price(W,seventy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f_74,axiom,
! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> class(W,second) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief2) ).
tff(f_70,axiom,
! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> dest(W,paris) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief1) ).
tff(f_52,axiom,
! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( ( dest(W,paris)
& class(W,second) )
=> price(W,seventy) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',law2) ).
tff(c_20,plain,
$ki_accessible($ki_local_world,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_16,plain,
! [W_10: $ki_world] :
( class(W_10,second)
| ~ $ki_accessible($ki_local_world,W_10) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_14,plain,
! [W_9: $ki_world] :
( dest(W_9,paris)
| ~ $ki_accessible($ki_local_world,W_9) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_46,plain,
! [W_22: $ki_world] :
( price(W_22,seventy)
| ~ class(W_22,second)
| ~ dest(W_22,paris)
| ~ $ki_accessible($ki_local_world,W_22) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_18,plain,
~ price('#skF_1',seventy),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_52,plain,
( ~ class('#skF_1',second)
| ~ dest('#skF_1',paris)
| ~ $ki_accessible($ki_local_world,'#skF_1') ),
inference(resolution,[status(thm)],[c_46,c_18]) ).
tff(c_56,plain,
( ~ class('#skF_1',second)
| ~ dest('#skF_1',paris) ),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_52]) ).
tff(c_57,plain,
~ dest('#skF_1',paris),
inference(splitLeft,[status(thm)],[c_56]) ).
tff(c_60,plain,
~ $ki_accessible($ki_local_world,'#skF_1'),
inference(resolution,[status(thm)],[c_14,c_57]) ).
tff(c_64,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_60]) ).
tff(c_65,plain,
~ class('#skF_1',second),
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_69,plain,
~ $ki_accessible($ki_local_world,'#skF_1'),
inference(resolution,[status(thm)],[c_16,c_65]) ).
tff(c_73,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NLP267_4 : TPTP v8.2.0. Released v8.2.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.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 12:58:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.19/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.21/1.83
% 3.21/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.21/1.85
% 3.21/1.85 Inference rules
% 3.21/1.85 ----------------------
% 3.21/1.85 #Ref : 0
% 3.21/1.85 #Sup : 8
% 3.21/1.85 #Fact : 0
% 3.21/1.85 #Define : 0
% 3.21/1.85 #Split : 1
% 3.21/1.85 #Chain : 0
% 3.21/1.85 #Close : 0
% 3.21/1.85
% 3.21/1.85 Ordering : KBO
% 3.21/1.85
% 3.21/1.85 Simplification rules
% 3.21/1.85 ----------------------
% 3.21/1.85 #Subsume : 2
% 3.21/1.85 #Demod : 4
% 3.21/1.85 #Tautology : 2
% 3.21/1.85 #SimpNegUnit : 0
% 3.21/1.85 #BackRed : 0
% 3.21/1.85
% 3.21/1.85 #Partial instantiations: 0
% 3.21/1.85 #Strategies tried : 1
% 3.21/1.85
% 3.21/1.85 Timing (in seconds)
% 3.21/1.85 ----------------------
% 3.21/1.86 Preprocessing : 0.53
% 3.21/1.86 Parsing : 0.33
% 3.21/1.86 CNF conversion : 0.03
% 3.21/1.86 Main loop : 0.20
% 3.21/1.86 Inferencing : 0.08
% 3.21/1.86 Reduction : 0.04
% 3.21/1.86 Demodulation : 0.03
% 3.21/1.86 BG Simplification : 0.02
% 3.21/1.86 Subsumption : 0.05
% 3.21/1.86 Abstraction : 0.01
% 3.21/1.86 MUC search : 0.00
% 3.21/1.86 Cooper : 0.00
% 3.21/1.86 Total : 0.77
% 3.21/1.86 Index Insertion : 0.00
% 3.21/1.86 Index Deletion : 0.00
% 3.21/1.86 Index Matching : 0.00
% 3.21/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------