TSTP Solution File: SYN728+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN728+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/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 : n007.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:45 EDT 2023
% Result : Theorem 2.15s 1.61s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 23 ( 10 ~; 6 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 7 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 21 (; 18 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > q > m > f > #nlpp > g > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(m,type,
m: $i > $o ).
tff(q,type,
q: $i > $o ).
tff(g,type,
g: $i > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(p,type,
p: ( $i * $i ) > $o ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_51,negated_conjecture,
~ ( ( ! [X] :
( ? [Y] : p(X,Y)
=> ! [Z] : p(Z,Z) )
& ! [R] :
? [S] :
( p(R,S)
| ( m(R)
& q(f(R,S)) ) )
& ! [W] :
( q(W)
=> ~ m(g(W)) ) )
=> ! [U] :
? [V] :
( p(g(U),V)
& p(U,U) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69) ).
tff(c_6,plain,
! [Z_5,X_1,Y_4] :
( p(Z_5,Z_5)
| ~ p(X_1,Y_4) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_13,plain,
! [X_1,Y_4] : ~ p(X_1,Y_4),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_10,plain,
! [R_6] :
( m(R_6)
| p(R_6,'#skF_2'(R_6)) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_14,plain,
! [R_6] : m(R_6),
inference(negUnitSimplification,[status(thm)],[c_13,c_10]) ).
tff(c_4,plain,
! [W_8] :
( ~ m(g(W_8))
| ~ q(W_8) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_17,plain,
! [W_8] : ~ q(W_8),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_4]) ).
tff(c_8,plain,
! [R_6] :
( q(f(R_6,'#skF_1'(R_6)))
| p(R_6,'#skF_2'(R_6)) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_20,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_13,c_17,c_8]) ).
tff(c_21,plain,
! [Z_5] : p(Z_5,Z_5),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_2,plain,
! [V_10] :
( ~ p('#skF_3','#skF_3')
| ~ p(g('#skF_3'),V_10) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_25,plain,
! [V_18] : ~ p(g('#skF_3'),V_18),
inference(demodulation,[status(thm),theory(equality)],[c_21,c_2]) ).
tff(c_34,plain,
$false,
inference(resolution,[status(thm)],[c_21,c_25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN728+1 : TPTP v8.1.2. Released v2.5.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.18/0.36 % Computer : n007.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 17:21:24 EDT 2023
% 0.18/0.36 % CPUTime :
% 2.15/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.15/1.61
% 2.15/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.75/1.65
% 2.75/1.65 Inference rules
% 2.75/1.65 ----------------------
% 2.75/1.65 #Ref : 0
% 2.75/1.65 #Sup : 2
% 2.75/1.65 #Fact : 0
% 2.75/1.65 #Define : 0
% 2.75/1.65 #Split : 1
% 2.75/1.65 #Chain : 0
% 2.75/1.65 #Close : 0
% 2.75/1.65
% 2.75/1.65 Ordering : KBO
% 2.75/1.65
% 2.75/1.65 Simplification rules
% 2.75/1.65 ----------------------
% 2.75/1.65 #Subsume : 1
% 2.75/1.65 #Demod : 2
% 2.75/1.65 #Tautology : 0
% 2.75/1.65 #SimpNegUnit : 2
% 2.75/1.65 #BackRed : 2
% 2.75/1.65
% 2.75/1.65 #Partial instantiations: 0
% 2.75/1.65 #Strategies tried : 1
% 2.75/1.65
% 2.75/1.65 Timing (in seconds)
% 2.75/1.65 ----------------------
% 2.75/1.65 Preprocessing : 0.41
% 2.75/1.65 Parsing : 0.23
% 2.75/1.65 CNF conversion : 0.03
% 2.75/1.65 Main loop : 0.16
% 2.75/1.65 Inferencing : 0.07
% 2.75/1.65 Reduction : 0.02
% 2.75/1.65 Demodulation : 0.01
% 2.75/1.65 BG Simplification : 0.01
% 2.75/1.65 Subsumption : 0.03
% 2.75/1.65 Abstraction : 0.00
% 2.75/1.65 MUC search : 0.00
% 2.75/1.65 Cooper : 0.00
% 2.75/1.65 Total : 0.62
% 2.75/1.65 Index Insertion : 0.00
% 2.75/1.65 Index Deletion : 0.00
% 2.75/1.65 Index Matching : 0.00
% 2.75/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------