TSTP Solution File: SYN050-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN050-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 : n025.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:07 EDT 2023
% Result : Unsatisfiable 2.12s 1.54s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_s > big_r > big_q > big_p > f > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(big_s,type,
big_s: $i > $o ).
tff(big_q,type,
big_q: $i > $o ).
tff(b,type,
b: $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(big_r,type,
big_r: $i > $o ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_42,axiom,
! [W] : ~ big_r(W),
file(unknown,unknown) ).
tff(f_29,axiom,
! [Y,Z] :
( ~ big_p(Y)
| ~ big_q(Z)
| big_r(f(Y,Z)) ),
file(unknown,unknown) ).
tff(f_38,axiom,
big_p(a),
file(unknown,unknown) ).
tff(f_39,axiom,
big_q(b),
file(unknown,unknown) ).
tff(c_10,plain,
! [W_6] : ~ big_r(W_6),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_2,plain,
! [Y_1,Z_2] :
( big_r(f(Y_1,Z_2))
| ~ big_q(Z_2)
| ~ big_p(Y_1) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_11,plain,
! [Z_2,Y_1] :
( ~ big_q(Z_2)
| ~ big_p(Y_1) ),
inference(negUnitSimplification,[status(thm)],[c_10,c_2]) ).
tff(c_13,plain,
! [Y_1] : ~ big_p(Y_1),
inference(splitLeft,[status(thm)],[c_11]) ).
tff(c_6,plain,
big_p(a),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_15,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_13,c_6]) ).
tff(c_16,plain,
! [Z_2] : ~ big_q(Z_2),
inference(splitRight,[status(thm)],[c_11]) ).
tff(c_8,plain,
big_q(b),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_18,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN050-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/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 : n025.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:34 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.12/1.54 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.12/1.55
% 2.12/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.12/1.58
% 2.12/1.58 Inference rules
% 2.12/1.58 ----------------------
% 2.12/1.58 #Ref : 0
% 2.12/1.58 #Sup : 0
% 2.12/1.58 #Fact : 0
% 2.12/1.58 #Define : 0
% 2.12/1.58 #Split : 1
% 2.12/1.58 #Chain : 0
% 2.12/1.58 #Close : 0
% 2.12/1.58
% 2.12/1.58 Ordering : KBO
% 2.12/1.58
% 2.12/1.58 Simplification rules
% 2.12/1.58 ----------------------
% 2.12/1.58 #Subsume : 1
% 2.12/1.58 #Demod : 0
% 2.12/1.58 #Tautology : 0
% 2.12/1.58 #SimpNegUnit : 3
% 2.12/1.58 #BackRed : 2
% 2.12/1.58
% 2.12/1.58 #Partial instantiations: 0
% 2.12/1.58 #Strategies tried : 1
% 2.12/1.58
% 2.12/1.58 Timing (in seconds)
% 2.12/1.58 ----------------------
% 2.12/1.58 Preprocessing : 0.38
% 2.12/1.58 Parsing : 0.21
% 2.12/1.58 CNF conversion : 0.02
% 2.12/1.58 Main loop : 0.12
% 2.12/1.58 Inferencing : 0.03
% 2.12/1.58 Reduction : 0.03
% 2.12/1.58 Demodulation : 0.02
% 2.12/1.58 BG Simplification : 0.01
% 2.12/1.59 Subsumption : 0.03
% 2.12/1.59 Abstraction : 0.00
% 2.12/1.59 MUC search : 0.00
% 2.12/1.59 Cooper : 0.00
% 2.12/1.59 Total : 0.55
% 2.12/1.59 Index Insertion : 0.00
% 2.12/1.59 Index Deletion : 0.00
% 2.12/1.59 Index Matching : 0.00
% 2.12/1.59 BG Taut test : 0.00
%------------------------------------------------------------------------------