TSTP Solution File: SYN060-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN060-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 : n020.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:11 EDT 2023
% Result : Unsatisfiable 2.14s 1.60s
% Output : CNFRefutation 2.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 17 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_i > big_h > big_g > big_f > #nlpp > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(big_h,type,
big_h: $i > $o ).
tff(big_g,type,
big_g: $i > $o ).
tff(big_i,type,
big_i: $i > $o ).
tff(big_f,type,
big_f: $i > $o ).
tff(f_46,axiom,
! [X] :
( big_i(X)
| big_f(X) ),
file(unknown,unknown) ).
tff(f_52,axiom,
~ big_i(a),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X] :
( big_i(X)
| big_h(X) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X] :
( ~ big_f(X)
| ~ big_h(X) ),
file(unknown,unknown) ).
tff(c_27,plain,
! [X_11] :
( big_f(X_11)
| big_i(X_11) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_14,plain,
~ big_i(a),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_31,plain,
big_f(a),
inference(resolution,[status(thm)],[c_27,c_14]) ).
tff(c_32,plain,
! [X_12] :
( big_h(X_12)
| big_i(X_12) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_36,plain,
big_h(a),
inference(resolution,[status(thm)],[c_32,c_14]) ).
tff(c_2,plain,
! [X_1] :
( ~ big_h(X_1)
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_42,plain,
~ big_f(a),
inference(resolution,[status(thm)],[c_36,c_2]) ).
tff(c_47,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_31,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SYN060-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/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.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 17:19:22 EDT 2023
% 0.16/0.36 % CPUTime :
% 2.14/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/1.60
% 2.14/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.70/1.63
% 2.70/1.63 Inference rules
% 2.70/1.63 ----------------------
% 2.70/1.63 #Ref : 0
% 2.70/1.63 #Sup : 6
% 2.70/1.63 #Fact : 0
% 2.70/1.63 #Define : 0
% 2.70/1.63 #Split : 0
% 2.70/1.63 #Chain : 0
% 2.70/1.63 #Close : 0
% 2.70/1.63
% 2.70/1.63 Ordering : KBO
% 2.70/1.63
% 2.70/1.63 Simplification rules
% 2.70/1.63 ----------------------
% 2.70/1.63 #Subsume : 0
% 2.70/1.63 #Demod : 1
% 2.70/1.63 #Tautology : 1
% 2.70/1.63 #SimpNegUnit : 0
% 2.70/1.63 #BackRed : 0
% 2.70/1.63
% 2.70/1.63 #Partial instantiations: 0
% 2.70/1.63 #Strategies tried : 1
% 2.70/1.63
% 2.70/1.63 Timing (in seconds)
% 2.70/1.63 ----------------------
% 2.70/1.63 Preprocessing : 0.39
% 2.70/1.63 Parsing : 0.21
% 2.70/1.63 CNF conversion : 0.02
% 2.70/1.63 Main loop : 0.18
% 2.70/1.63 Inferencing : 0.10
% 2.70/1.63 Reduction : 0.02
% 2.70/1.63 Demodulation : 0.02
% 2.70/1.63 BG Simplification : 0.01
% 2.70/1.63 Subsumption : 0.03
% 2.70/1.63 Abstraction : 0.00
% 2.70/1.63 MUC search : 0.00
% 2.70/1.63 Cooper : 0.00
% 2.70/1.63 Total : 0.61
% 2.81/1.63 Index Insertion : 0.00
% 2.81/1.63 Index Deletion : 0.00
% 2.81/1.63 Index Matching : 0.00
% 2.81/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------