TSTP Solution File: NLP267_2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NLP267_2 : 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 : n001.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:48 EDT 2023
% Result : Theorem 2.92s 1.62s
% Output : CNFRefutation 2.94s
% 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_73,negated_conjecture,
~ ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> price(W,seventy) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f_68,axiom,
! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> class(W,second) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).
tff(f_64,axiom,
! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> dest(W,paris) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).
tff(f_46,axiom,
! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( ( dest(W,paris)
& class(W,second) )
=> price(W,seventy) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).
tff(c_18,plain,
$ki_accessible($ki_local_world,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_14,plain,
! [W_7: $ki_world] :
( class(W_7,second)
| ~ $ki_accessible($ki_local_world,W_7) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_12,plain,
! [W_6: $ki_world] :
( dest(W_6,paris)
| ~ $ki_accessible($ki_local_world,W_6) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_29,plain,
! [W_14: $ki_world] :
( price(W_14,seventy)
| ~ class(W_14,second)
| ~ dest(W_14,paris)
| ~ $ki_accessible($ki_local_world,W_14) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_16,plain,
~ price('#skF_1',seventy),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_35,plain,
( ~ class('#skF_1',second)
| ~ dest('#skF_1',paris)
| ~ $ki_accessible($ki_local_world,'#skF_1') ),
inference(resolution,[status(thm)],[c_29,c_16]) ).
tff(c_39,plain,
( ~ class('#skF_1',second)
| ~ dest('#skF_1',paris) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_35]) ).
tff(c_40,plain,
~ dest('#skF_1',paris),
inference(splitLeft,[status(thm)],[c_39]) ).
tff(c_43,plain,
~ $ki_accessible($ki_local_world,'#skF_1'),
inference(resolution,[status(thm)],[c_12,c_40]) ).
tff(c_47,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_43]) ).
tff(c_48,plain,
~ class('#skF_1',second),
inference(splitRight,[status(thm)],[c_39]) ).
tff(c_52,plain,
~ $ki_accessible($ki_local_world,'#skF_1'),
inference(resolution,[status(thm)],[c_14,c_48]) ).
tff(c_56,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NLP267_2 : TPTP v8.2.0. Released v8.2.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.34 % Computer : n001.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu Aug 3 13:38:10 EDT 2023
% 0.15/0.34 % CPUTime :
% 2.92/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.94/1.63
% 2.94/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.94/1.65
% 2.94/1.65 Inference rules
% 2.94/1.65 ----------------------
% 2.94/1.65 #Ref : 0
% 2.94/1.65 #Sup : 5
% 2.94/1.65 #Fact : 0
% 2.94/1.65 #Define : 0
% 2.94/1.65 #Split : 1
% 2.94/1.65 #Chain : 0
% 2.94/1.65 #Close : 0
% 2.94/1.65
% 2.94/1.65 Ordering : KBO
% 2.94/1.65
% 2.94/1.65 Simplification rules
% 2.94/1.65 ----------------------
% 2.94/1.65 #Subsume : 1
% 2.94/1.65 #Demod : 3
% 2.94/1.65 #Tautology : 0
% 2.94/1.65 #SimpNegUnit : 0
% 2.94/1.65 #BackRed : 0
% 2.94/1.65
% 2.94/1.65 #Partial instantiations: 0
% 2.94/1.65 #Strategies tried : 1
% 2.94/1.65
% 2.94/1.65 Timing (in seconds)
% 2.94/1.65 ----------------------
% 2.94/1.66 Preprocessing : 0.45
% 2.94/1.66 Parsing : 0.27
% 2.94/1.66 CNF conversion : 0.02
% 2.94/1.66 Main loop : 0.17
% 2.94/1.66 Inferencing : 0.08
% 2.94/1.66 Reduction : 0.03
% 2.94/1.66 Demodulation : 0.03
% 2.94/1.66 BG Simplification : 0.02
% 2.94/1.66 Subsumption : 0.04
% 2.94/1.66 Abstraction : 0.01
% 2.94/1.66 MUC search : 0.00
% 2.94/1.66 Cooper : 0.00
% 2.94/1.66 Total : 0.66
% 2.94/1.66 Index Insertion : 0.00
% 2.94/1.66 Index Deletion : 0.00
% 2.94/1.66 Index Matching : 0.00
% 2.94/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------