TSTP Solution File: SYN068-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN068-1 : TPTP v8.1.2. Released v1.0.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 : n024.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:09:28 EDT 2023
% Result : Unsatisfiable 2.43s 1.64s
% Output : CNFRefutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 22 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 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 : 7 ( 6 >; 1 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_h > big_j > big_g > big_f > #nlpp > g > f > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(big_h,type,
big_h: ( $i * $i ) > $o ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(big_g,type,
big_g: $i > $o ).
tff(big_f,type,
big_f: $i > $o ).
tff(big_j,type,
big_j: $i > $o ).
tff(f_45,axiom,
big_j(a),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] :
( ~ big_j(X)
| big_f(X) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X] :
( ~ big_f(X)
| big_g(g(X)) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X] :
( ~ big_g(X)
| big_h(a,X) ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X] :
( ~ big_f(X)
| ~ big_h(X,g(X)) ),
file(unknown,unknown) ).
tff(c_10,plain,
big_j(a),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_15,plain,
! [X_7] :
( big_f(X_7)
| ~ big_j(X_7) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_19,plain,
big_f(a),
inference(resolution,[status(thm)],[c_10,c_15]) ).
tff(c_6,plain,
! [X_3] :
( big_g(g(X_3))
| ~ big_f(X_3) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_12,plain,
! [X_5] :
( big_h(a,X_5)
| ~ big_g(X_5) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_24,plain,
! [X_12] :
( ~ big_h(X_12,g(X_12))
| ~ big_f(X_12) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_28,plain,
( ~ big_f(a)
| ~ big_g(g(a)) ),
inference(resolution,[status(thm)],[c_12,c_24]) ).
tff(c_31,plain,
~ big_g(g(a)),
inference(demodulation,[status(thm),theory(equality)],[c_19,c_28]) ).
tff(c_34,plain,
~ big_f(a),
inference(resolution,[status(thm)],[c_6,c_31]) ).
tff(c_38,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN068-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/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.14/0.36 % Computer : n024.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:20:45 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.43/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.61/1.64
% 2.61/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.61/1.66
% 2.61/1.66 Inference rules
% 2.61/1.66 ----------------------
% 2.61/1.66 #Ref : 0
% 2.61/1.66 #Sup : 3
% 2.61/1.66 #Fact : 0
% 2.61/1.67 #Define : 0
% 2.61/1.67 #Split : 0
% 2.61/1.67 #Chain : 0
% 2.61/1.67 #Close : 0
% 2.61/1.67
% 2.61/1.67 Ordering : KBO
% 2.61/1.67
% 2.61/1.67 Simplification rules
% 2.61/1.67 ----------------------
% 2.61/1.67 #Subsume : 0
% 2.61/1.67 #Demod : 2
% 2.61/1.67 #Tautology : 0
% 2.61/1.67 #SimpNegUnit : 0
% 2.61/1.67 #BackRed : 0
% 2.61/1.67
% 2.61/1.67 #Partial instantiations: 0
% 2.61/1.67 #Strategies tried : 1
% 2.61/1.67
% 2.61/1.67 Timing (in seconds)
% 2.61/1.67 ----------------------
% 2.61/1.67 Preprocessing : 0.39
% 2.61/1.67 Parsing : 0.22
% 2.61/1.67 CNF conversion : 0.02
% 2.61/1.67 Main loop : 0.16
% 2.61/1.67 Inferencing : 0.08
% 2.61/1.67 Reduction : 0.03
% 2.61/1.67 Demodulation : 0.02
% 2.61/1.67 BG Simplification : 0.01
% 2.61/1.67 Subsumption : 0.02
% 2.61/1.67 Abstraction : 0.00
% 2.61/1.67 MUC search : 0.00
% 2.61/1.67 Cooper : 0.00
% 2.61/1.67 Total : 0.59
% 2.61/1.67 Index Insertion : 0.00
% 2.61/1.67 Index Deletion : 0.00
% 2.61/1.67 Index Matching : 0.00
% 2.61/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------