TSTP Solution File: SYN063-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN063-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 : n003.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:12 EDT 2023
% Result : Unsatisfiable 2.37s 1.57s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 12 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > e > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(d,type,
d: $i ).
tff(e,type,
e: $i ).
tff(c,type,
c: $i ).
tff(f_23,axiom,
big_p(a),
file(unknown,unknown) ).
tff(f_41,axiom,
~ big_p(c),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] :
( ~ big_p(a)
| big_p(X)
| big_p(c)
| big_p(Y) ),
file(unknown,unknown) ).
tff(f_39,axiom,
( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ),
file(unknown,unknown) ).
tff(c_2,plain,
big_p(a),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_8,plain,
~ big_p(c),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_4,plain,
! [Y_2,X_1] :
( big_p(Y_2)
| big_p(c)
| big_p(X_1)
| ~ big_p(a) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_18,plain,
! [Y_2,X_1] :
( big_p(Y_2)
| big_p(X_1)
| ~ big_p(a) ),
inference(negUnitSimplification,[status(thm)],[c_8,c_4]) ).
tff(c_22,plain,
! [Y_2,X_1] :
( big_p(Y_2)
| big_p(X_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_18]) ).
tff(c_24,plain,
! [X_1] : big_p(X_1),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_6,plain,
( big_p(c)
| ~ big_p(b)
| ~ big_p(a) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_17,plain,
( ~ big_p(b)
| ~ big_p(a) ),
inference(negUnitSimplification,[status(thm)],[c_8,c_6]) ).
tff(c_20,plain,
~ big_p(b),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_17]) ).
tff(c_30,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_20]) ).
tff(c_31,plain,
! [Y_2] : big_p(Y_2),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_31,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN063-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 17:25:38 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.37/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.37/1.58
% 2.37/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.64/1.61
% 2.64/1.61 Inference rules
% 2.64/1.61 ----------------------
% 2.64/1.61 #Ref : 0
% 2.64/1.61 #Sup : 0
% 2.64/1.61 #Fact : 0
% 2.64/1.61 #Define : 0
% 2.64/1.61 #Split : 1
% 2.64/1.61 #Chain : 0
% 2.64/1.61 #Close : 0
% 2.64/1.61
% 2.64/1.61 Ordering : KBO
% 2.64/1.61
% 2.64/1.61 Simplification rules
% 2.64/1.61 ----------------------
% 2.64/1.61 #Subsume : 2
% 2.64/1.61 #Demod : 8
% 2.64/1.61 #Tautology : 2
% 2.64/1.61 #SimpNegUnit : 5
% 2.64/1.61 #BackRed : 4
% 2.64/1.61
% 2.64/1.61 #Partial instantiations: 0
% 2.64/1.61 #Strategies tried : 1
% 2.64/1.61
% 2.64/1.61 Timing (in seconds)
% 2.64/1.61 ----------------------
% 2.64/1.62 Preprocessing : 0.41
% 2.64/1.62 Parsing : 0.22
% 2.64/1.62 CNF conversion : 0.02
% 2.64/1.62 Main loop : 0.13
% 2.64/1.62 Inferencing : 0.03
% 2.64/1.62 Reduction : 0.03
% 2.64/1.62 Demodulation : 0.02
% 2.64/1.62 BG Simplification : 0.02
% 2.64/1.62 Subsumption : 0.04
% 2.64/1.62 Abstraction : 0.01
% 2.64/1.62 MUC search : 0.00
% 2.64/1.62 Cooper : 0.00
% 2.64/1.62 Total : 0.60
% 2.64/1.62 Index Insertion : 0.00
% 2.64/1.62 Index Deletion : 0.00
% 2.64/1.62 Index Matching : 0.00
% 2.64/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------