TSTP Solution File: SYN328-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN328-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 : n013.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 3.04s 1.82s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 32 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 57 ( 25 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ h > g > f > #nlpp > z > y
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(z,type,
z: $i > $i ).
tff(h,type,
h: $i > $o ).
tff(y,type,
y: $i > $i ).
tff(g,type,
g: $i > $o ).
tff(f,type,
f: $i > $o ).
tff(f_38,axiom,
! [X] :
( f(y(X))
| f(X) ),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X] :
( ~ f(y(X))
| g(y(X))
| h(X) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [X] :
( ~ g(y(X))
| f(X) ),
file(unknown,unknown) ).
tff(f_87,axiom,
! [X] :
( ~ h(y(X))
| h(X) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [X] :
( ~ f(y(X))
| h(y(X))
| ~ g(X) ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [X] :
( ~ h(y(X))
| g(X) ),
file(unknown,unknown) ).
tff(f_96,axiom,
! [X] :
( ~ f(z(X))
| ~ g(z(X))
| ~ h(z(X)) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] :
( f(X_2)
| f(y(X_2)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_55,plain,
! [X_20] :
( h(X_20)
| g(y(X_20))
| ~ f(y(X_20)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_6,plain,
! [X_3] :
( f(X_3)
| ~ g(y(X_3)) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_69,plain,
! [X_22] :
( f(X_22)
| h(X_22)
| ~ f(y(X_22)) ),
inference(resolution,[status(thm)],[c_55,c_6]) ).
tff(c_78,plain,
! [X_23] :
( h(X_23)
| f(X_23) ),
inference(resolution,[status(thm)],[c_4,c_69]) ).
tff(c_20,plain,
! [X_10] :
( h(X_10)
| ~ h(y(X_10)) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_86,plain,
! [X_10] :
( h(X_10)
| f(y(X_10)) ),
inference(resolution,[status(thm)],[c_78,c_20]) ).
tff(c_18,plain,
! [X_9] :
( h(X_9)
| g(y(X_9))
| ~ f(y(X_9)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_87,plain,
! [X_24] :
( h(X_24)
| f(y(X_24)) ),
inference(resolution,[status(thm)],[c_78,c_20]) ).
tff(c_28,plain,
! [X_17] :
( ~ g(X_17)
| h(y(X_17))
| ~ f(y(X_17)) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_36,plain,
! [X_17] :
( h(X_17)
| ~ g(X_17)
| ~ f(y(X_17)) ),
inference(resolution,[status(thm)],[c_28,c_20]) ).
tff(c_92,plain,
! [X_25] :
( ~ g(X_25)
| h(X_25) ),
inference(resolution,[status(thm)],[c_87,c_36]) ).
tff(c_106,plain,
! [X_27] :
( h(X_27)
| ~ g(y(X_27)) ),
inference(resolution,[status(thm)],[c_92,c_20]) ).
tff(c_111,plain,
! [X_28] :
( h(X_28)
| ~ f(y(X_28)) ),
inference(resolution,[status(thm)],[c_18,c_106]) ).
tff(c_121,plain,
! [X_10] : h(X_10),
inference(resolution,[status(thm)],[c_86,c_111]) ).
tff(c_12,plain,
! [X_6] :
( g(X_6)
| ~ h(y(X_6)) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_131,plain,
! [X_6] : g(X_6),
inference(demodulation,[status(thm),theory(equality)],[c_121,c_12]) ).
tff(c_149,plain,
! [X_3] : f(X_3),
inference(demodulation,[status(thm),theory(equality)],[c_131,c_6]) ).
tff(c_22,plain,
! [X_11] :
( ~ h(z(X_11))
| ~ g(z(X_11))
| ~ f(z(X_11)) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_158,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_149,c_131,c_121,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SYN328-1 : TPTP v8.1.2. Released v1.2.0.
% 0.13/0.15 % 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.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:17:32 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.04/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.04/1.83
% 3.04/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.17/1.86
% 3.17/1.86 Inference rules
% 3.17/1.86 ----------------------
% 3.17/1.86 #Ref : 0
% 3.17/1.86 #Sup : 23
% 3.17/1.86 #Fact : 0
% 3.17/1.86 #Define : 0
% 3.17/1.86 #Split : 0
% 3.17/1.86 #Chain : 0
% 3.17/1.86 #Close : 0
% 3.17/1.86
% 3.17/1.86 Ordering : KBO
% 3.17/1.86
% 3.17/1.86 Simplification rules
% 3.17/1.86 ----------------------
% 3.17/1.86 #Subsume : 9
% 3.17/1.86 #Demod : 27
% 3.17/1.86 #Tautology : 18
% 3.17/1.86 #SimpNegUnit : 0
% 3.17/1.86 #BackRed : 2
% 3.17/1.86
% 3.17/1.86 #Partial instantiations: 0
% 3.17/1.86 #Strategies tried : 1
% 3.17/1.86
% 3.17/1.86 Timing (in seconds)
% 3.17/1.86 ----------------------
% 3.17/1.86 Preprocessing : 0.43
% 3.17/1.86 Parsing : 0.23
% 3.17/1.86 CNF conversion : 0.02
% 3.17/1.86 Main loop : 0.25
% 3.17/1.86 Inferencing : 0.12
% 3.17/1.86 Reduction : 0.04
% 3.17/1.86 Demodulation : 0.02
% 3.17/1.86 BG Simplification : 0.02
% 3.17/1.86 Subsumption : 0.06
% 3.17/1.86 Abstraction : 0.01
% 3.17/1.86 MUC search : 0.00
% 3.17/1.86 Cooper : 0.00
% 3.17/1.86 Total : 0.73
% 3.17/1.86 Index Insertion : 0.00
% 3.17/1.86 Index Deletion : 0.00
% 3.17/1.86 Index Matching : 0.00
% 3.17/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------