TSTP Solution File: SYN946+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN946+1 : TPTP v8.1.2. Released v3.1.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 : n013.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:16:57 EDT 2023
% Result : Theorem 2.05s 1.45s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 5 ( 2 ~; 1 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 6 (; 4 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > p > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(q,type,
q: $i > $o ).
tff(p,type,
p: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(r,type,
r: $i > $o ).
tff(f_36,negated_conjecture,
~ ( ( ! [X] : p(X)
& ? [Y] : q(Y) )
=> ? [Z] :
! [Y] :
( p(Y)
| r(Z) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_8,plain,
! [X_1] : p(X_1),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_4,plain,
! [Z_2] : ~ p('#skF_2'(Z_2)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_10,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN946+1 : TPTP v8.1.2. Released v3.1.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 : n013.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 17:12:33 EDT 2023
% 0.21/0.36 % CPUTime :
% 2.05/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.05/1.45
% 2.05/1.45 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.05/1.49
% 2.05/1.49 Inference rules
% 2.05/1.49 ----------------------
% 2.05/1.49 #Ref : 0
% 2.05/1.49 #Sup : 0
% 2.05/1.49 #Fact : 0
% 2.05/1.49 #Define : 0
% 2.05/1.49 #Split : 0
% 2.05/1.49 #Chain : 0
% 2.05/1.49 #Close : 0
% 2.05/1.49
% 2.05/1.49 Ordering : KBO
% 2.05/1.49
% 2.05/1.49 Simplification rules
% 2.05/1.49 ----------------------
% 2.05/1.49 #Subsume : 3
% 2.05/1.49 #Demod : 1
% 2.05/1.49 #Tautology : 0
% 2.05/1.49 #SimpNegUnit : 0
% 2.05/1.49 #BackRed : 0
% 2.05/1.49
% 2.05/1.49 #Partial instantiations: 0
% 2.05/1.49 #Strategies tried : 1
% 2.05/1.49
% 2.05/1.49 Timing (in seconds)
% 2.05/1.49 ----------------------
% 2.05/1.49 Preprocessing : 0.37
% 2.05/1.49 Parsing : 0.21
% 2.05/1.49 CNF conversion : 0.02
% 2.05/1.49 Main loop : 0.05
% 2.05/1.49 Inferencing : 0.00
% 2.05/1.49 Reduction : 0.02
% 2.05/1.49 Demodulation : 0.02
% 2.05/1.49 BG Simplification : 0.01
% 2.05/1.49 Subsumption : 0.02
% 2.05/1.49 Abstraction : 0.00
% 2.05/1.49 MUC search : 0.00
% 2.05/1.49 Cooper : 0.00
% 2.05/1.49 Total : 0.48
% 2.05/1.50 Index Insertion : 0.00
% 2.05/1.50 Index Deletion : 0.00
% 2.05/1.50 Index Matching : 0.00
% 2.05/1.50 BG Taut test : 0.00
%------------------------------------------------------------------------------