TSTP Solution File: SYN049+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN049+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/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 : 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:09:07 EDT 2023
% Result : Theorem 2.14s 1.46s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 10 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 7 (; 6 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(big_q,type,
big_q: $i > $o ).
tff(big_p,type,
big_p: $i > $o ).
tff(f_35,negated_conjecture,
~ ? [X] :
! [Y,Z] :
( ( big_p(Y)
=> big_q(Z) )
=> ( big_p(X)
=> big_q(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel19) ).
tff(c_2,plain,
! [X_1] : ~ big_q(X_1),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_4,plain,
! [X_1] : big_p(X_1),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_6,plain,
! [X_1] :
( big_q('#skF_2'(X_1))
| ~ big_p('#skF_1'(X_1)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8,plain,
! [X_1] : big_q('#skF_2'(X_1)),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_6]) ).
tff(c_9,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN049+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/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.14/0.35 % Computer : n005.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:28:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.14/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/1.47
% 2.14/1.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.14/1.51
% 2.14/1.51 Inference rules
% 2.14/1.51 ----------------------
% 2.14/1.51 #Ref : 0
% 2.14/1.51 #Sup : 0
% 2.14/1.51 #Fact : 0
% 2.14/1.51 #Define : 0
% 2.14/1.51 #Split : 0
% 2.14/1.51 #Chain : 0
% 2.14/1.51 #Close : 0
% 2.14/1.51
% 2.14/1.51 Ordering : KBO
% 2.14/1.51
% 2.14/1.51 Simplification rules
% 2.14/1.51 ----------------------
% 2.14/1.51 #Subsume : 2
% 2.14/1.51 #Demod : 1
% 2.14/1.51 #Tautology : 0
% 2.14/1.51 #SimpNegUnit : 1
% 2.14/1.51 #BackRed : 0
% 2.14/1.51
% 2.14/1.51 #Partial instantiations: 0
% 2.14/1.51 #Strategies tried : 1
% 2.14/1.51
% 2.14/1.51 Timing (in seconds)
% 2.14/1.51 ----------------------
% 2.14/1.51 Preprocessing : 0.40
% 2.14/1.51 Parsing : 0.22
% 2.14/1.51 CNF conversion : 0.02
% 2.14/1.51 Main loop : 0.05
% 2.14/1.51 Inferencing : 0.00
% 2.14/1.51 Reduction : 0.02
% 2.14/1.51 Demodulation : 0.02
% 2.14/1.51 BG Simplification : 0.01
% 2.14/1.51 Subsumption : 0.02
% 2.14/1.51 Abstraction : 0.00
% 2.14/1.51 MUC search : 0.00
% 2.14/1.51 Cooper : 0.00
% 2.14/1.51 Total : 0.51
% 2.14/1.51 Index Insertion : 0.00
% 2.14/1.51 Index Deletion : 0.00
% 2.14/1.51 Index Matching : 0.00
% 2.14/1.51 BG Taut test : 0.00
%------------------------------------------------------------------------------