TSTP Solution File: SYN061-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN061-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/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 : n016.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.11s 1.57s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 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 : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_j > 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(big_j,type,
big_j: $i > $o ).
tff(f_36,axiom,
big_f(a),
file(unknown,unknown) ).
tff(f_35,axiom,
big_i(a),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X] :
( big_h(X)
| big_j(X) ),
file(unknown,unknown) ).
tff(f_46,axiom,
! [X] :
( ~ big_i(X)
| ~ big_j(X) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X] :
( ~ big_f(X)
| ~ big_h(X) ),
file(unknown,unknown) ).
tff(c_8,plain,
big_f(a),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_6,plain,
big_i(a),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_10,plain,
! [X_3] :
( big_j(X_3)
| big_h(X_3) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_15,plain,
! [X_7] :
( ~ big_j(X_7)
| ~ big_i(X_7) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_21,plain,
! [X_9] :
( ~ big_i(X_9)
| big_h(X_9) ),
inference(resolution,[status(thm)],[c_10,c_15]) ).
tff(c_25,plain,
big_h(a),
inference(resolution,[status(thm)],[c_6,c_21]) ).
tff(c_4,plain,
! [X_2] :
( ~ big_h(X_2)
| ~ big_f(X_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_28,plain,
~ big_f(a),
inference(resolution,[status(thm)],[c_25,c_4]) ).
tff(c_32,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN061-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.13/0.35 % Computer : n016.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:36:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.11/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.11/1.58
% 2.11/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.11/1.60
% 2.11/1.60 Inference rules
% 2.11/1.60 ----------------------
% 2.11/1.60 #Ref : 0
% 2.11/1.60 #Sup : 3
% 2.11/1.60 #Fact : 0
% 2.11/1.60 #Define : 0
% 2.11/1.60 #Split : 0
% 2.11/1.60 #Chain : 0
% 2.11/1.60 #Close : 0
% 2.11/1.60
% 2.11/1.60 Ordering : KBO
% 2.11/1.60
% 2.11/1.60 Simplification rules
% 2.11/1.60 ----------------------
% 2.11/1.60 #Subsume : 0
% 2.11/1.60 #Demod : 1
% 2.11/1.60 #Tautology : 0
% 2.11/1.60 #SimpNegUnit : 0
% 2.11/1.60 #BackRed : 0
% 2.11/1.60
% 2.11/1.60 #Partial instantiations: 0
% 2.11/1.60 #Strategies tried : 1
% 2.11/1.60
% 2.11/1.60 Timing (in seconds)
% 2.11/1.60 ----------------------
% 2.11/1.61 Preprocessing : 0.38
% 2.11/1.61 Parsing : 0.21
% 2.11/1.61 CNF conversion : 0.02
% 2.11/1.61 Main loop : 0.16
% 2.11/1.61 Inferencing : 0.09
% 2.11/1.61 Reduction : 0.03
% 2.11/1.61 Demodulation : 0.02
% 2.11/1.61 BG Simplification : 0.01
% 2.11/1.61 Subsumption : 0.02
% 2.11/1.61 Abstraction : 0.00
% 2.11/1.61 MUC search : 0.00
% 2.11/1.61 Cooper : 0.00
% 2.11/1.61 Total : 0.59
% 2.11/1.61 Index Insertion : 0.00
% 2.11/1.61 Index Deletion : 0.00
% 2.11/1.61 Index Matching : 0.00
% 2.11/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------