TSTP Solution File: SYN031-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN031-1 : TPTP v8.1.2. Released v1.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 : n025.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:08:33 EDT 2023
% Result : Unsatisfiable 2.58s 1.69s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 9 |; 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ g > #nlpp > f > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: ( $i * $i ) > $o ).
tff(f_27,axiom,
! [A] :
( g(A,a)
| g(f(A),A) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [A,B] :
( ~ g(A,B)
| ~ g(B,a) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A] :
( g(A,a)
| g(A,f(A)) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [A,B] :
( ~ g(A,B)
| g(B,f(B)) ),
file(unknown,unknown) ).
tff(c_12,plain,
! [A_11] :
( g(f(A_11),A_11)
| g(A_11,a) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_10,plain,
! [B_8,A_7] :
( ~ g(B_8,a)
| ~ g(A_7,B_8) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_16,plain,
! [A_7] :
( ~ g(A_7,f(a))
| g(a,a) ),
inference(resolution,[status(thm)],[c_12,c_10]) ).
tff(c_32,plain,
! [A_7] : ~ g(A_7,f(a)),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_4,plain,
! [A_2] :
( g(A_2,f(A_2))
| g(A_2,a) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_33,plain,
! [A_17] : ~ g(A_17,f(a)),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_42,plain,
g(a,a),
inference(resolution,[status(thm)],[c_4,c_33]) ).
tff(c_8,plain,
! [B_6,A_5] :
( g(B_6,f(B_6))
| ~ g(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_47,plain,
g(a,f(a)),
inference(resolution,[status(thm)],[c_42,c_8]) ).
tff(c_54,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_47]) ).
tff(c_55,plain,
g(a,a),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_64,plain,
! [A_7] : ~ g(A_7,a),
inference(resolution,[status(thm)],[c_55,c_10]) ).
tff(c_68,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_64,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN031-1 : TPTP v8.1.2. Released v1.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 : n025.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:29:19 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.58/1.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/1.69
% 2.58/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.58/1.73
% 2.58/1.73 Inference rules
% 2.58/1.73 ----------------------
% 2.58/1.73 #Ref : 0
% 2.58/1.73 #Sup : 13
% 2.58/1.73 #Fact : 0
% 2.58/1.73 #Define : 0
% 2.58/1.73 #Split : 1
% 2.58/1.73 #Chain : 0
% 2.58/1.73 #Close : 0
% 2.58/1.73
% 2.58/1.73 Ordering : KBO
% 2.58/1.73
% 2.58/1.73 Simplification rules
% 2.58/1.73 ----------------------
% 2.58/1.73 #Subsume : 3
% 2.58/1.73 #Demod : 0
% 2.58/1.73 #Tautology : 0
% 2.58/1.73 #SimpNegUnit : 4
% 2.58/1.73 #BackRed : 3
% 2.58/1.73
% 2.58/1.73 #Partial instantiations: 0
% 2.58/1.73 #Strategies tried : 1
% 2.58/1.73
% 2.58/1.73 Timing (in seconds)
% 2.58/1.73 ----------------------
% 2.58/1.73 Preprocessing : 0.38
% 2.58/1.73 Parsing : 0.21
% 2.58/1.73 CNF conversion : 0.02
% 2.58/1.73 Main loop : 0.17
% 2.58/1.73 Inferencing : 0.08
% 2.58/1.73 Reduction : 0.02
% 2.58/1.73 Demodulation : 0.01
% 2.58/1.73 BG Simplification : 0.01
% 2.58/1.73 Subsumption : 0.05
% 2.58/1.73 Abstraction : 0.01
% 2.58/1.73 MUC search : 0.00
% 2.58/1.73 Cooper : 0.00
% 2.58/1.73 Total : 0.61
% 2.58/1.73 Index Insertion : 0.00
% 2.58/1.73 Index Deletion : 0.00
% 2.58/1.73 Index Matching : 0.00
% 2.58/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------