TSTP Solution File: SYN315-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN315-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 : n017.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:23 EDT 2023
% Result : Unsatisfiable 2.43s 1.55s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 18 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > f > #nlpp > y > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(p,type,
p: $i > $o ).
tff(y,type,
y: $i > $i ).
tff(f,type,
f: $i > $o ).
tff(f_36,axiom,
! [X] :
( ~ p(a)
| f(X) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] :
( ~ f(X)
| p(a) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X] :
( p(a)
| f(y(X)) ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [X] :
( ~ f(y(X))
| ~ p(a) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] :
( f(X_2)
| ~ p(a) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_9,plain,
~ p(a),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_2,plain,
! [X_1] :
( p(a)
| ~ f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_10,plain,
! [X_1] : ~ f(X_1),
inference(negUnitSimplification,[status(thm)],[c_9,c_2]) ).
tff(c_8,plain,
! [X_4] :
( f(y(X_4))
| p(a) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_12,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9,c_10,c_8]) ).
tff(c_13,plain,
! [X_2] : f(X_2),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_14,plain,
p(a),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_6,plain,
! [X_3] :
( ~ p(a)
| ~ f(y(X_3)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_19,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_13,c_14,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : SYN315-1 : TPTP v8.1.2. Released v1.2.0.
% 0.14/0.16 % 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 : n017.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 16:56:21 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.43/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.43/1.56
% 2.43/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.48/1.59
% 2.48/1.59 Inference rules
% 2.48/1.59 ----------------------
% 2.48/1.59 #Ref : 0
% 2.48/1.59 #Sup : 0
% 2.48/1.59 #Fact : 0
% 2.48/1.59 #Define : 0
% 2.48/1.59 #Split : 1
% 2.48/1.59 #Chain : 0
% 2.48/1.59 #Close : 0
% 2.48/1.59
% 2.48/1.59 Ordering : KBO
% 2.48/1.59
% 2.48/1.59 Simplification rules
% 2.48/1.59 ----------------------
% 2.48/1.59 #Subsume : 0
% 2.48/1.59 #Demod : 4
% 2.48/1.59 #Tautology : 1
% 2.48/1.59 #SimpNegUnit : 2
% 2.48/1.59 #BackRed : 0
% 2.48/1.59
% 2.48/1.59 #Partial instantiations: 0
% 2.48/1.59 #Strategies tried : 1
% 2.48/1.59
% 2.48/1.59 Timing (in seconds)
% 2.48/1.59 ----------------------
% 2.48/1.60 Preprocessing : 0.38
% 2.48/1.60 Parsing : 0.21
% 2.48/1.60 CNF conversion : 0.02
% 2.48/1.60 Main loop : 0.11
% 2.48/1.60 Inferencing : 0.04
% 2.48/1.60 Reduction : 0.02
% 2.48/1.60 Demodulation : 0.01
% 2.48/1.60 BG Simplification : 0.01
% 2.48/1.60 Subsumption : 0.03
% 2.48/1.60 Abstraction : 0.00
% 2.48/1.60 MUC search : 0.00
% 2.48/1.60 Cooper : 0.00
% 2.48/1.60 Total : 0.54
% 2.48/1.60 Index Insertion : 0.00
% 2.48/1.60 Index Deletion : 0.00
% 2.48/1.60 Index Matching : 0.00
% 2.48/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------