TSTP Solution File: SYN346-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN346-1 : TPTP v8.1.2. Released v1.2.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:33 EDT 2023
% Result : Unsatisfiable 2.31s 1.67s
% Output : CNFRefutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 10 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > z2 > z1 > #nlpp > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(z1,type,
z1: ( $i * $i ) > $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(z2,type,
z2: ( $i * $i ) > $i ).
tff(f_30,axiom,
! [Y1,Y2] : f(Y1,z2(Y1,Y2)),
file(unknown,unknown) ).
tff(f_42,axiom,
! [Y1,Y2] :
( ~ f(b,z2(Y1,Y2))
| ~ f(Y2,z2(Y1,Y2)) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [Y1_3,Y2_4] : f(Y1_3,z2(Y1_3,Y2_4)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_11,plain,
! [Y2_13,Y1_14] :
( ~ f(Y2_13,z2(Y1_14,Y2_13))
| ~ f(b,z2(Y1_14,Y2_13)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_16,plain,
! [Y2_15] : ~ f(b,z2(Y2_15,Y2_15)),
inference(resolution,[status(thm)],[c_4,c_11]) ).
tff(c_21,plain,
$false,
inference(resolution,[status(thm)],[c_4,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : SYN346-1 : TPTP v8.1.2. Released v1.2.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.15/0.37 % Computer : n007.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 17:05:08 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.31/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.31/1.67
% 2.31/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.65/1.71
% 2.65/1.71 Inference rules
% 2.65/1.71 ----------------------
% 2.65/1.71 #Ref : 0
% 2.65/1.71 #Sup : 2
% 2.65/1.71 #Fact : 0
% 2.65/1.71 #Define : 0
% 2.65/1.71 #Split : 0
% 2.65/1.71 #Chain : 0
% 2.65/1.71 #Close : 0
% 2.65/1.71
% 2.65/1.71 Ordering : KBO
% 2.65/1.71
% 2.65/1.71 Simplification rules
% 2.65/1.71 ----------------------
% 2.65/1.71 #Subsume : 0
% 2.65/1.71 #Demod : 0
% 2.65/1.71 #Tautology : 0
% 2.65/1.71 #SimpNegUnit : 0
% 2.65/1.71 #BackRed : 0
% 2.65/1.71
% 2.65/1.71 #Partial instantiations: 0
% 2.65/1.71 #Strategies tried : 1
% 2.65/1.71
% 2.65/1.71 Timing (in seconds)
% 2.65/1.71 ----------------------
% 2.65/1.71 Preprocessing : 0.42
% 2.65/1.71 Parsing : 0.23
% 2.65/1.71 CNF conversion : 0.02
% 2.65/1.71 Main loop : 0.13
% 2.65/1.71 Inferencing : 0.06
% 2.65/1.71 Reduction : 0.03
% 2.65/1.71 Demodulation : 0.02
% 2.65/1.71 BG Simplification : 0.01
% 2.65/1.71 Subsumption : 0.03
% 2.65/1.71 Abstraction : 0.00
% 2.65/1.71 MUC search : 0.00
% 2.65/1.71 Cooper : 0.00
% 2.65/1.71 Total : 0.60
% 2.65/1.71 Index Insertion : 0.00
% 2.65/1.71 Index Deletion : 0.00
% 2.65/1.71 Index Matching : 0.00
% 2.65/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------