TSTP Solution File: SYN370+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN370+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 : n012.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:39 EDT 2023
% Result : Theorem 2.49s 1.66s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 10 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 5 ( 2 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 7 (; 5 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > h > f > a > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(big_p,type,
big_p: ( $i * $i * $i ) > $o ).
tff(f,type,
f: $i > $i ).
tff(h,type,
h: $i > $i ).
tff(f_34,negated_conjecture,
~ ? [V] :
! [Y] :
? [Z] :
( ( big_p(a,Y,h(Y))
| big_p(V,Y,f(Y)) )
=> big_p(V,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2121) ).
tff(c_4,plain,
! [V_1,Z_6] : ~ big_p(V_1,'#skF_1'(V_1),Z_6),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [V_1] :
( big_p(V_1,'#skF_1'(V_1),f('#skF_1'(V_1)))
| big_p(a,'#skF_1'(V_1),h('#skF_1'(V_1))) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_7,plain,
! [V_9] : big_p(a,'#skF_1'(V_9),h('#skF_1'(V_9))),
inference(negUnitSimplification,[status(thm)],[c_4,c_2]) ).
tff(c_12,plain,
$false,
inference(resolution,[status(thm)],[c_7,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN370+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.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:10:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.49/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.49/1.66
% 2.49/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.58/1.70
% 2.58/1.70 Inference rules
% 2.58/1.70 ----------------------
% 2.58/1.70 #Ref : 0
% 2.58/1.70 #Sup : 1
% 2.58/1.70 #Fact : 0
% 2.58/1.70 #Define : 0
% 2.58/1.70 #Split : 0
% 2.58/1.70 #Chain : 0
% 2.58/1.70 #Close : 0
% 2.58/1.70
% 2.58/1.70 Ordering : KBO
% 2.58/1.70
% 2.58/1.70 Simplification rules
% 2.58/1.70 ----------------------
% 2.58/1.70 #Subsume : 0
% 2.58/1.70 #Demod : 0
% 2.58/1.70 #Tautology : 0
% 2.58/1.70 #SimpNegUnit : 1
% 2.58/1.70 #BackRed : 0
% 2.58/1.70
% 2.58/1.70 #Partial instantiations: 0
% 2.58/1.70 #Strategies tried : 1
% 2.58/1.70
% 2.58/1.70 Timing (in seconds)
% 2.58/1.70 ----------------------
% 2.58/1.70 Preprocessing : 0.39
% 2.58/1.70 Parsing : 0.23
% 2.58/1.70 CNF conversion : 0.02
% 2.58/1.70 Main loop : 0.10
% 2.58/1.70 Inferencing : 0.05
% 2.58/1.70 Reduction : 0.02
% 2.58/1.70 Demodulation : 0.01
% 2.58/1.70 BG Simplification : 0.01
% 2.58/1.70 Subsumption : 0.02
% 2.58/1.70 Abstraction : 0.00
% 2.58/1.70 MUC search : 0.00
% 2.58/1.70 Cooper : 0.00
% 2.58/1.70 Total : 0.55
% 2.58/1.70 Index Insertion : 0.00
% 2.58/1.70 Index Deletion : 0.00
% 2.58/1.70 Index Matching : 0.00
% 2.58/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------