TSTP Solution File: SYN355+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN355+1 : TPTP v8.1.2. Released v2.0.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 : n010.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:10:36 EDT 2023
% Result : Theorem 2.02s 1.54s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 12 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 13 ( 5 ~; 4 |; 1 &)
% ( 0 <=>; 3 =>; 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 : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_r > big_q > big_p > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_q,type,
big_q: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(big_r,type,
big_r: $i > $o ).
tff(f_41,negated_conjecture,
~ ( ( ! [X] :
( big_r(X)
=> big_p(X) )
& ! [X] :
( ~ big_q(X)
=> big_r(X) ) )
=> ! [X] :
( big_p(X)
| big_q(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2106) ).
tff(c_4,plain,
~ big_p('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_10,plain,
! [X_4] :
( big_r(X_4)
| big_q(X_4) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_8,plain,
! [X_1] :
( big_p(X_1)
| ~ big_r(X_1) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_15,plain,
! [X_5] :
( big_p(X_5)
| big_q(X_5) ),
inference(resolution,[status(thm)],[c_10,c_8]) ).
tff(c_2,plain,
~ big_q('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_18,plain,
big_p('#skF_1'),
inference(resolution,[status(thm)],[c_15,c_2]) ).
tff(c_22,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN355+1 : TPTP v8.1.2. Released v2.0.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.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:21:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.02/1.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.02/1.55
% 2.02/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.58/1.58
% 2.58/1.58 Inference rules
% 2.58/1.58 ----------------------
% 2.58/1.58 #Ref : 0
% 2.58/1.58 #Sup : 2
% 2.58/1.58 #Fact : 0
% 2.58/1.58 #Define : 0
% 2.58/1.58 #Split : 0
% 2.58/1.58 #Chain : 0
% 2.58/1.58 #Close : 0
% 2.58/1.58
% 2.58/1.58 Ordering : KBO
% 2.58/1.58
% 2.58/1.58 Simplification rules
% 2.58/1.58 ----------------------
% 2.58/1.58 #Subsume : 0
% 2.58/1.58 #Demod : 0
% 2.58/1.58 #Tautology : 0
% 2.58/1.58 #SimpNegUnit : 1
% 2.58/1.58 #BackRed : 0
% 2.58/1.58
% 2.58/1.58 #Partial instantiations: 0
% 2.58/1.58 #Strategies tried : 1
% 2.58/1.58
% 2.58/1.58 Timing (in seconds)
% 2.58/1.58 ----------------------
% 2.58/1.58 Preprocessing : 0.39
% 2.58/1.58 Parsing : 0.22
% 2.58/1.58 CNF conversion : 0.02
% 2.58/1.58 Main loop : 0.14
% 2.58/1.58 Inferencing : 0.09
% 2.58/1.58 Reduction : 0.01
% 2.58/1.58 Demodulation : 0.01
% 2.58/1.58 BG Simplification : 0.01
% 2.58/1.58 Subsumption : 0.02
% 2.58/1.58 Abstraction : 0.00
% 2.58/1.58 MUC search : 0.00
% 2.58/1.58 Cooper : 0.00
% 2.58/1.58 Total : 0.58
% 2.58/1.58 Index Insertion : 0.00
% 2.58/1.58 Index Deletion : 0.00
% 2.58/1.58 Index Matching : 0.00
% 2.58/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------