TSTP Solution File: SYN969+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN969+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/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 : n007.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:17:00 EDT 2023
% Result : Theorem 2.56s 1.64s
% Output : CNFRefutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 12 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 (; 5 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > p > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
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_39,negated_conjecture,
~ ! [B] :
( ( ! [X] :
( p(X)
=> q(X) )
& r(B) )
=> ( ! [Y] :
( r(Y)
=> p(Y) )
=> q(B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_6,plain,
r('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_9,plain,
! [Y_5] :
( p(Y_5)
| ~ r(Y_5) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_13,plain,
p('#skF_1'),
inference(resolution,[status(thm)],[c_6,c_9]) ).
tff(c_14,plain,
! [X_6] :
( q(X_6)
| ~ p(X_6) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_2,plain,
~ q('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_17,plain,
~ p('#skF_1'),
inference(resolution,[status(thm)],[c_14,c_2]) ).
tff(c_21,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_13,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN969+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/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.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 16:56:08 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.56/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.56/1.64
% 2.56/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.56/1.66
% 2.56/1.66 Inference rules
% 2.56/1.66 ----------------------
% 2.56/1.66 #Ref : 0
% 2.56/1.66 #Sup : 2
% 2.56/1.66 #Fact : 0
% 2.56/1.66 #Define : 0
% 2.56/1.66 #Split : 0
% 2.56/1.66 #Chain : 0
% 2.56/1.66 #Close : 0
% 2.56/1.66
% 2.56/1.66 Ordering : KBO
% 2.56/1.66
% 2.56/1.66 Simplification rules
% 2.56/1.66 ----------------------
% 2.56/1.66 #Subsume : 0
% 2.56/1.66 #Demod : 1
% 2.56/1.66 #Tautology : 0
% 2.56/1.66 #SimpNegUnit : 0
% 2.56/1.66 #BackRed : 0
% 2.56/1.66
% 2.56/1.66 #Partial instantiations: 0
% 2.56/1.66 #Strategies tried : 1
% 2.56/1.66
% 2.56/1.66 Timing (in seconds)
% 2.56/1.66 ----------------------
% 2.56/1.67 Preprocessing : 0.39
% 2.56/1.67 Parsing : 0.22
% 2.56/1.67 CNF conversion : 0.02
% 2.56/1.67 Main loop : 0.13
% 2.56/1.67 Inferencing : 0.07
% 2.56/1.67 Reduction : 0.02
% 2.56/1.67 Demodulation : 0.02
% 2.56/1.67 BG Simplification : 0.01
% 2.56/1.67 Subsumption : 0.02
% 2.56/1.67 Abstraction : 0.00
% 2.56/1.67 MUC search : 0.00
% 2.56/1.67 Cooper : 0.00
% 2.56/1.67 Total : 0.57
% 2.56/1.67 Index Insertion : 0.00
% 2.56/1.67 Index Deletion : 0.00
% 2.56/1.67 Index Matching : 0.00
% 2.56/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------