TSTP Solution File: SYN721-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN721-1 : TPTP v8.1.2. Released v2.5.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 : n031.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:11:43 EDT 2023
% Result : Unsatisfiable 2.44s 1.59s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(q,type,
q: ( $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(r,type,
r: ( $i * $i ) > $o ).
tff(f_22,axiom,
r(a,b),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] :
( q(A,A)
| ~ r(A,B) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [C,B,A] :
( r(C,B)
| ~ q(A,B) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [A] :
( ~ q(A,a)
| ~ r(b,A) ),
file(unknown,unknown) ).
tff(c_2,plain,
r(a,b),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_10,plain,
! [A_10,B_11] :
( ~ r(A_10,B_11)
| q(A_10,A_10) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_13,plain,
q(a,a),
inference(resolution,[status(thm)],[c_2,c_10]) ).
tff(c_6,plain,
! [A_5,B_4,C_3] :
( ~ q(A_5,B_4)
| r(C_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_16,plain,
! [C_3] : r(C_3,a),
inference(resolution,[status(thm)],[c_13,c_6]) ).
tff(c_21,plain,
! [A_13] :
( ~ r(b,A_13)
| ~ q(A_13,a) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_25,plain,
~ q(a,a),
inference(resolution,[status(thm)],[c_16,c_21]) ).
tff(c_29,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_13,c_25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SYN721-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/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.37 % Computer : n031.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 17:36:29 EDT 2023
% 0.22/0.37 % CPUTime :
% 2.44/1.59 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.44/1.59
% 2.44/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.55/1.62
% 2.55/1.62 Inference rules
% 2.55/1.62 ----------------------
% 2.55/1.62 #Ref : 0
% 2.55/1.62 #Sup : 4
% 2.55/1.62 #Fact : 0
% 2.55/1.62 #Define : 0
% 2.55/1.62 #Split : 0
% 2.55/1.62 #Chain : 0
% 2.55/1.62 #Close : 0
% 2.55/1.62
% 2.55/1.62 Ordering : KBO
% 2.55/1.62
% 2.55/1.62 Simplification rules
% 2.55/1.62 ----------------------
% 2.55/1.62 #Subsume : 0
% 2.55/1.62 #Demod : 1
% 2.55/1.62 #Tautology : 0
% 2.55/1.62 #SimpNegUnit : 0
% 2.55/1.62 #BackRed : 0
% 2.55/1.62
% 2.55/1.62 #Partial instantiations: 0
% 2.55/1.62 #Strategies tried : 1
% 2.55/1.62
% 2.55/1.62 Timing (in seconds)
% 2.55/1.62 ----------------------
% 2.55/1.62 Preprocessing : 0.38
% 2.55/1.62 Parsing : 0.21
% 2.55/1.62 CNF conversion : 0.02
% 2.55/1.62 Main loop : 0.15
% 2.55/1.62 Inferencing : 0.07
% 2.55/1.62 Reduction : 0.03
% 2.55/1.62 Demodulation : 0.02
% 2.55/1.62 BG Simplification : 0.01
% 2.55/1.62 Subsumption : 0.03
% 2.55/1.62 Abstraction : 0.00
% 2.55/1.62 MUC search : 0.00
% 2.55/1.62 Cooper : 0.00
% 2.55/1.62 Total : 0.58
% 2.55/1.62 Index Insertion : 0.00
% 2.55/1.62 Index Deletion : 0.00
% 2.55/1.62 Index Matching : 0.00
% 2.55/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------