TSTP Solution File: SYN318-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN318-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 : n001.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:24 EDT 2023
% Result : Unsatisfiable 1.93s 1.47s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 13 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 5 (; 5 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > g > f > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(p,type,
p: $i > $o ).
tff(b,type,
b: $i ).
tff(g,type,
g: $i > $o ).
tff(f,type,
f: $i > $o ).
tff(f_37,axiom,
! [X] : f(X),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X] :
( ~ f(X)
| ~ f(b)
| g(X) ),
file(unknown,unknown) ).
tff(f_39,axiom,
~ g(b),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_2] : f(X_2),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_2,plain,
! [X_1] :
( g(X_1)
| ~ f(b)
| ~ f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_10,plain,
! [X_1] : g(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_2]) ).
tff(c_8,plain,
~ g(b),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_12,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN318-1 : TPTP v8.1.2. Released v1.2.0.
% 0.14/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.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:59:10 EDT 2023
% 0.14/0.36 % CPUTime :
% 1.93/1.47 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.93/1.48
% 1.93/1.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.93/1.52
% 1.93/1.52 Inference rules
% 1.93/1.52 ----------------------
% 1.93/1.52 #Ref : 0
% 1.93/1.52 #Sup : 0
% 1.93/1.52 #Fact : 0
% 1.93/1.52 #Define : 0
% 1.93/1.52 #Split : 0
% 1.93/1.52 #Chain : 0
% 1.93/1.52 #Close : 0
% 1.93/1.52
% 1.93/1.52 Ordering : KBO
% 1.93/1.52
% 1.93/1.52 Simplification rules
% 1.93/1.52 ----------------------
% 1.93/1.52 #Subsume : 3
% 1.93/1.52 #Demod : 3
% 1.93/1.52 #Tautology : 0
% 1.93/1.52 #SimpNegUnit : 0
% 1.93/1.52 #BackRed : 0
% 1.93/1.52
% 1.93/1.52 #Partial instantiations: 0
% 1.93/1.52 #Strategies tried : 1
% 1.93/1.52
% 1.93/1.52 Timing (in seconds)
% 1.93/1.52 ----------------------
% 1.93/1.52 Preprocessing : 0.37
% 1.93/1.52 Parsing : 0.20
% 1.93/1.52 CNF conversion : 0.02
% 1.93/1.52 Main loop : 0.05
% 1.93/1.52 Inferencing : 0.00
% 1.93/1.53 Reduction : 0.03
% 1.93/1.53 Demodulation : 0.02
% 1.93/1.53 BG Simplification : 0.01
% 1.93/1.53 Subsumption : 0.02
% 1.93/1.53 Abstraction : 0.00
% 1.93/1.53 MUC search : 0.00
% 1.93/1.53 Cooper : 0.00
% 1.93/1.53 Total : 0.49
% 1.93/1.53 Index Insertion : 0.00
% 1.93/1.53 Index Deletion : 0.00
% 1.93/1.53 Index Matching : 0.00
% 1.93/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------