TSTP Solution File: SYN321-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN321-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 : n027.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:25 EDT 2023
% Result : Unsatisfiable 2.04s 1.63s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 23 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 8 |; 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 : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ g > f > #nlpp > d > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(g,type,
g: ( $i * $i ) > $o ).
tff(d,type,
d: $i ).
tff(f_31,axiom,
! [Z,U] :
( ~ f(a,Z)
| g(a,U) ),
file(unknown,unknown) ).
tff(f_45,axiom,
( ~ f(a,b)
| ~ g(a,d) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [U] :
( f(a,b)
| g(a,U) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [U] :
( ~ g(U,U)
| f(U,b) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [U_2,Z_1] :
( g(a,U_2)
| ~ f(a,Z_1) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_23,plain,
! [Z_1] : ~ f(a,Z_1),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_8,plain,
( ~ g(a,d)
| ~ f(a,b) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_9,plain,
~ f(a,b),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_6,plain,
! [U_4] :
( g(a,U_4)
| f(a,b) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_10,plain,
! [U_4] : g(a,U_4),
inference(negUnitSimplification,[status(thm)],[c_9,c_6]) ).
tff(c_12,plain,
! [U_6] :
( f(U_6,b)
| ~ g(U_6,U_6) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_16,plain,
f(a,b),
inference(resolution,[status(thm)],[c_10,c_12]) ).
tff(c_20,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9,c_16]) ).
tff(c_22,plain,
f(a,b),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_25,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_23,c_22]) ).
tff(c_26,plain,
! [U_2] : g(a,U_2),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_21,plain,
~ g(a,d),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_29,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN321-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n027.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:33:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.04/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/1.63
% 2.04/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.57/1.66
% 2.57/1.66 Inference rules
% 2.57/1.66 ----------------------
% 2.57/1.66 #Ref : 0
% 2.57/1.66 #Sup : 1
% 2.57/1.66 #Fact : 0
% 2.57/1.66 #Define : 0
% 2.57/1.66 #Split : 2
% 2.57/1.66 #Chain : 0
% 2.57/1.66 #Close : 0
% 2.57/1.66
% 2.57/1.66 Ordering : KBO
% 2.57/1.66
% 2.57/1.66 Simplification rules
% 2.57/1.66 ----------------------
% 2.57/1.66 #Subsume : 0
% 2.57/1.66 #Demod : 1
% 2.57/1.66 #Tautology : 0
% 2.57/1.66 #SimpNegUnit : 3
% 2.57/1.66 #BackRed : 2
% 2.57/1.66
% 2.57/1.66 #Partial instantiations: 0
% 2.57/1.66 #Strategies tried : 1
% 2.57/1.66
% 2.57/1.66 Timing (in seconds)
% 2.57/1.66 ----------------------
% 2.57/1.66 Preprocessing : 0.39
% 2.57/1.66 Parsing : 0.21
% 2.57/1.66 CNF conversion : 0.02
% 2.57/1.66 Main loop : 0.15
% 2.57/1.66 Inferencing : 0.07
% 2.57/1.66 Reduction : 0.03
% 2.57/1.66 Demodulation : 0.02
% 2.57/1.66 BG Simplification : 0.01
% 2.57/1.66 Subsumption : 0.02
% 2.57/1.66 Abstraction : 0.00
% 2.57/1.66 MUC search : 0.00
% 2.57/1.66 Cooper : 0.00
% 2.57/1.66 Total : 0.58
% 2.57/1.66 Index Insertion : 0.00
% 2.57/1.66 Index Deletion : 0.00
% 2.57/1.66 Index Matching : 0.00
% 2.57/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------