TSTP Solution File: SYN376+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN376+1 : TPTP v8.1.2. Bugfixed v2.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:10:40 EDT 2023
% Result : Theorem 2.06s 1.56s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 7 unt; 4 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 8 (; 7 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(f_39,negated_conjecture,
~ ( ? [X] :
! [Y] :
( big_p(Y)
<=> big_p(X) )
=> ( ! [X] : big_p(X)
| ! [X] : ~ big_p(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2127) ).
tff(c_8,plain,
! [Y_2] :
( big_p(Y_2)
| ~ big_p('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_9,plain,
~ big_p('#skF_1'),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_6,plain,
! [Y_2] :
( big_p('#skF_1')
| ~ big_p(Y_2) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_10,plain,
! [Y_2] : ~ big_p(Y_2),
inference(negUnitSimplification,[status(thm)],[c_9,c_6]) ).
tff(c_2,plain,
big_p('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_12,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_2]) ).
tff(c_13,plain,
! [Y_2] : big_p(Y_2),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_4,plain,
~ big_p('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_18,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_13,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN376+1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.15 % 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.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 17:04:23 EDT 2023
% 0.16/0.37 % CPUTime :
% 2.06/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.06/1.56
% 2.06/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.06/1.60
% 2.06/1.60 Inference rules
% 2.06/1.60 ----------------------
% 2.06/1.60 #Ref : 0
% 2.06/1.60 #Sup : 0
% 2.06/1.60 #Fact : 0
% 2.06/1.60 #Define : 0
% 2.06/1.60 #Split : 1
% 2.06/1.60 #Chain : 0
% 2.06/1.60 #Close : 0
% 2.06/1.60
% 2.06/1.60 Ordering : KBO
% 2.06/1.60
% 2.06/1.60 Simplification rules
% 2.06/1.60 ----------------------
% 2.06/1.60 #Subsume : 2
% 2.06/1.60 #Demod : 2
% 2.06/1.60 #Tautology : 1
% 2.06/1.60 #SimpNegUnit : 2
% 2.06/1.60 #BackRed : 2
% 2.06/1.60
% 2.06/1.60 #Partial instantiations: 0
% 2.06/1.60 #Strategies tried : 1
% 2.06/1.60
% 2.06/1.60 Timing (in seconds)
% 2.06/1.60 ----------------------
% 2.06/1.60 Preprocessing : 0.38
% 2.06/1.60 Parsing : 0.21
% 2.06/1.60 CNF conversion : 0.02
% 2.06/1.60 Main loop : 0.12
% 2.06/1.60 Inferencing : 0.03
% 2.06/1.60 Reduction : 0.02
% 2.06/1.60 Demodulation : 0.02
% 2.06/1.60 BG Simplification : 0.01
% 2.06/1.60 Subsumption : 0.03
% 2.06/1.60 Abstraction : 0.00
% 2.06/1.60 MUC search : 0.00
% 2.06/1.60 Cooper : 0.00
% 2.06/1.61 Total : 0.55
% 2.06/1.61 Index Insertion : 0.00
% 2.06/1.61 Index Deletion : 0.00
% 2.06/1.61 Index Matching : 0.00
% 2.06/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------