TSTP Solution File: SYO896_7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO896_7 : 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 : n005.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:36 EDT 2023
% Result : Theorem 2.73s 1.62s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 24 ( 11 ~; 6 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 6 ( 6 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 (; 4 !; 1 ?; 5 :)
% 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 ).
tff(f_49,negated_conjecture,
~ ( ( ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( p(W)
=> q(W) ) )
& ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( p(W)
=> ~ q(W) ) ) )
=> ~ ? [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
& p(W) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(c_2,plain,
p('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_4,plain,
$ki_accessible($ki_local_world,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_9,plain,
! [W_3: $ki_world] :
( q(W_3)
| ~ p(W_3)
| ~ $ki_accessible($ki_local_world,W_3) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_12,plain,
( q('#skF_1')
| ~ p('#skF_1') ),
inference(resolution,[status(thm)],[c_4,c_9]) ).
tff(c_15,plain,
q('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_12]) ).
tff(c_16,plain,
! [W_4: $ki_world] :
( ~ q(W_4)
| ~ p(W_4)
| ~ $ki_accessible($ki_local_world,W_4) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_19,plain,
( ~ q('#skF_1')
| ~ p('#skF_1') ),
inference(resolution,[status(thm)],[c_4,c_16]) ).
tff(c_23,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_15,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO896_7 : 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.18/0.36 % Computer : n005.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 15:57:42 EDT 2023
% 0.18/0.36 % CPUTime :
% 2.73/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.62
% 2.73/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.79/1.65
% 2.79/1.65 Inference rules
% 2.79/1.65 ----------------------
% 2.79/1.65 #Ref : 0
% 2.79/1.65 #Sup : 2
% 2.79/1.65 #Fact : 0
% 2.79/1.65 #Define : 0
% 2.79/1.65 #Split : 0
% 2.79/1.65 #Chain : 0
% 2.79/1.65 #Close : 0
% 2.79/1.65
% 2.79/1.65 Ordering : KBO
% 2.79/1.65
% 2.79/1.65 Simplification rules
% 2.79/1.65 ----------------------
% 2.79/1.65 #Subsume : 0
% 2.79/1.65 #Demod : 3
% 2.79/1.65 #Tautology : 0
% 2.79/1.65 #SimpNegUnit : 0
% 2.79/1.65 #BackRed : 0
% 2.79/1.65
% 2.79/1.65 #Partial instantiations: 0
% 2.79/1.65 #Strategies tried : 1
% 2.79/1.65
% 2.79/1.65 Timing (in seconds)
% 2.79/1.65 ----------------------
% 2.79/1.65 Preprocessing : 0.43
% 2.79/1.65 Parsing : 0.26
% 2.79/1.65 CNF conversion : 0.02
% 2.79/1.65 Main loop : 0.14
% 2.79/1.65 Inferencing : 0.07
% 2.79/1.65 Reduction : 0.02
% 2.79/1.65 Demodulation : 0.02
% 2.79/1.65 BG Simplification : 0.01
% 2.79/1.65 Subsumption : 0.03
% 2.79/1.65 Abstraction : 0.00
% 2.79/1.65 MUC search : 0.00
% 2.79/1.65 Cooper : 0.00
% 2.79/1.65 Total : 0.62
% 2.79/1.65 Index Insertion : 0.00
% 2.79/1.65 Index Deletion : 0.00
% 2.79/1.65 Index Matching : 0.00
% 2.79/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------