TSTP Solution File: SYN327-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN327-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/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 : 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:10:27 EDT 2023
% Result : Unsatisfiable 2.52s 1.67s
% Output : CNFRefutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 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 : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > z > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(z,type,
z: $i > $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff(f_30,axiom,
! [Y] :
( f(Y,a)
| f(a,Y) ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [Y] :
( ~ f(a,Y)
| ~ f(Y,a)
| ~ f(z(Y),Y) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [Y] :
( ~ f(a,Y)
| ~ f(a,z(Y)) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [Y_1] :
( f(a,Y_1)
| f(Y_1,a) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_25,plain,
f(a,a),
inference(factorization,[status(thm),theory(equality)],[c_2]) ).
tff(c_42,plain,
! [Y_11] :
( ~ f(z(Y_11),Y_11)
| ~ f(Y_11,a)
| ~ f(a,Y_11) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_46,plain,
( ~ f(a,a)
| f(a,z(a)) ),
inference(resolution,[status(thm)],[c_2,c_42]) ).
tff(c_49,plain,
f(a,z(a)),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_46]) ).
tff(c_10,plain,
! [Y_5] :
( ~ f(a,z(Y_5))
| ~ f(a,Y_5) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_55,plain,
~ f(a,a),
inference(resolution,[status(thm)],[c_49,c_10]) ).
tff(c_61,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_25,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN327-1 : TPTP v8.1.2. Released v1.2.0.
% 0.12/0.13 % 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.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:27:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.52/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.52/1.67
% 2.52/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.92/1.70
% 2.92/1.70 Inference rules
% 2.92/1.70 ----------------------
% 2.92/1.71 #Ref : 0
% 2.92/1.71 #Sup : 5
% 2.92/1.71 #Fact : 2
% 2.92/1.71 #Define : 0
% 2.92/1.71 #Split : 0
% 2.92/1.71 #Chain : 0
% 2.92/1.71 #Close : 0
% 2.92/1.71
% 2.92/1.71 Ordering : KBO
% 2.92/1.71
% 2.92/1.71 Simplification rules
% 2.92/1.71 ----------------------
% 2.92/1.71 #Subsume : 1
% 2.92/1.71 #Demod : 4
% 2.92/1.71 #Tautology : 3
% 2.92/1.71 #SimpNegUnit : 0
% 2.92/1.71 #BackRed : 0
% 2.92/1.71
% 2.92/1.71 #Partial instantiations: 0
% 2.92/1.71 #Strategies tried : 1
% 2.92/1.71
% 2.92/1.71 Timing (in seconds)
% 2.92/1.71 ----------------------
% 2.92/1.71 Preprocessing : 0.44
% 2.92/1.71 Parsing : 0.24
% 2.92/1.71 CNF conversion : 0.02
% 2.92/1.71 Main loop : 0.16
% 2.95/1.71 Inferencing : 0.08
% 2.95/1.71 Reduction : 0.03
% 2.95/1.71 Demodulation : 0.02
% 2.95/1.71 BG Simplification : 0.02
% 2.95/1.71 Subsumption : 0.04
% 2.95/1.71 Abstraction : 0.01
% 2.95/1.71 MUC search : 0.00
% 2.95/1.71 Cooper : 0.00
% 2.95/1.71 Total : 0.66
% 2.95/1.71 Index Insertion : 0.00
% 2.95/1.71 Index Deletion : 0.00
% 2.95/1.71 Index Matching : 0.00
% 2.95/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------