TSTP Solution File: SYO898_9 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO898_9 : 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 : n008.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:18:37 EDT 2023
% Result : Theorem 2.49s 1.51s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 12 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 6 ( 6 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 7 (; 5 !; 2 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp > #skF_1
%Foreground sorts:
tff($ki_world,type,
$ki_world: $tType ).
%Background operators:
%Foreground operators:
tff(p,type,
p: $ki_world > $o ).
tff(q,type,
q: $ki_world > $o ).
tff('#skF_1',type,
'#skF_1': $ki_world > $ki_world ).
tff(f_31,axiom,
! [W: $ki_world] :
? [V: $ki_world] : $ki_accessible(W,V),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_serial) ).
tff(f_43,negated_conjecture,
~ ( ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> p(W) )
=> ? [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
& ( q(W)
=> p(W) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(c_2,plain,
! [W_1: $ki_world] : $ki_accessible(W_1,'#skF_1'(W_1)),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_10,plain,
! [W_6: $ki_world] :
( ~ p(W_6)
| ~ $ki_accessible($ki_local_world,W_6) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_15,plain,
~ p('#skF_1'($ki_local_world)),
inference(resolution,[status(thm)],[c_2,c_10]) ).
tff(c_16,plain,
! [W_7: $ki_world] :
( p(W_7)
| ~ $ki_accessible($ki_local_world,W_7) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_20,plain,
p('#skF_1'($ki_local_world)),
inference(resolution,[status(thm)],[c_2,c_16]) ).
tff(c_24,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_15,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO898_9 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.13 % 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.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 15:57:19 EDT 2023
% 0.13/0.33 % CPUTime :
% 2.49/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.49/1.52
% 2.49/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.49/1.54
% 2.49/1.54 Inference rules
% 2.49/1.54 ----------------------
% 2.49/1.54 #Ref : 0
% 2.49/1.54 #Sup : 2
% 2.49/1.54 #Fact : 0
% 2.49/1.54 #Define : 0
% 2.49/1.54 #Split : 0
% 2.49/1.54 #Chain : 0
% 2.49/1.54 #Close : 0
% 2.49/1.54
% 2.49/1.54 Ordering : KBO
% 2.49/1.54
% 2.49/1.54 Simplification rules
% 2.49/1.54 ----------------------
% 2.49/1.54 #Subsume : 0
% 2.49/1.54 #Demod : 0
% 2.49/1.54 #Tautology : 0
% 2.49/1.54 #SimpNegUnit : 1
% 2.49/1.54 #BackRed : 0
% 2.49/1.54
% 2.49/1.54 #Partial instantiations: 0
% 2.49/1.54 #Strategies tried : 1
% 2.49/1.54
% 2.49/1.54 Timing (in seconds)
% 2.49/1.54 ----------------------
% 2.49/1.54 Preprocessing : 0.40
% 2.49/1.54 Parsing : 0.24
% 2.49/1.54 CNF conversion : 0.02
% 2.49/1.54 Main loop : 0.13
% 2.49/1.54 Inferencing : 0.06
% 2.49/1.54 Reduction : 0.02
% 2.49/1.54 Demodulation : 0.02
% 2.49/1.54 BG Simplification : 0.01
% 2.49/1.54 Subsumption : 0.03
% 2.49/1.54 Abstraction : 0.00
% 2.49/1.54 MUC search : 0.00
% 2.49/1.54 Cooper : 0.00
% 2.49/1.54 Total : 0.57
% 2.49/1.54 Index Insertion : 0.00
% 2.49/1.54 Index Deletion : 0.00
% 2.49/1.54 Index Matching : 0.00
% 2.49/1.55 BG Taut test : 0.00
%------------------------------------------------------------------------------