TSTP Solution File: SYN980+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN980+1 : TPTP v8.1.2. Released v3.1.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 : n002.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:17:02 EDT 2023
% Result : Theorem 2.17s 1.56s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 4 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 16 (; 14 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > r > #nlpp > f > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: ( $i * $i ) > $o ).
tff(f,type,
f: $i > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(p,type,
p: ( $i * $i ) > $o ).
tff(r,type,
r: $i > $o ).
tff(f_39,negated_conjecture,
~ ! [B] :
( ! [Y] :
( ( r(B)
=> r(Y) )
=> p(f(Y),Y) )
=> ? [X,Y] :
( p(X,Y)
& ( q(f(B),B)
=> q(X,Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_8,plain,
! [Y_4] :
( r('#skF_1')
| p(f(Y_4),Y_4) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_9,plain,
r('#skF_1'),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_6,plain,
! [Y_4] :
( ~ r(Y_4)
| p(f(Y_4),Y_4) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_4,plain,
! [X_5,Y_6] :
( q(f('#skF_1'),'#skF_1')
| ~ p(X_5,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_12,plain,
! [X_5,Y_6] : ~ p(X_5,Y_6),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_13,plain,
! [Y_4] : ~ r(Y_4),
inference(negUnitSimplification,[status(thm)],[c_12,c_6]) ).
tff(c_16,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_13,c_9]) ).
tff(c_17,plain,
q(f('#skF_1'),'#skF_1'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_2,plain,
! [X_5,Y_6] :
( ~ q(X_5,Y_6)
| ~ p(X_5,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_21,plain,
~ p(f('#skF_1'),'#skF_1'),
inference(resolution,[status(thm)],[c_17,c_2]) ).
tff(c_24,plain,
~ r('#skF_1'),
inference(resolution,[status(thm)],[c_6,c_21]) ).
tff(c_28,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9,c_24]) ).
tff(c_29,plain,
! [Y_4] : p(f(Y_4),Y_4),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_35,plain,
! [X_5,Y_6] : ~ p(X_5,Y_6),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_37,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_35,c_29]) ).
tff(c_38,plain,
q(f('#skF_1'),'#skF_1'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_41,plain,
~ p(f('#skF_1'),'#skF_1'),
inference(resolution,[status(thm)],[c_38,c_2]) ).
tff(c_45,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_29,c_41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN980+1 : TPTP v8.1.2. Released v3.1.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.15/0.35 % Computer : n002.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:24:01 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.17/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.17/1.56
% 2.17/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.17/1.58
% 2.17/1.58 Inference rules
% 2.17/1.58 ----------------------
% 2.17/1.58 #Ref : 0
% 2.17/1.58 #Sup : 3
% 2.17/1.58 #Fact : 0
% 2.17/1.58 #Define : 0
% 2.17/1.58 #Split : 3
% 2.17/1.58 #Chain : 0
% 2.17/1.58 #Close : 0
% 2.17/1.58
% 2.17/1.58 Ordering : KBO
% 2.17/1.58
% 2.17/1.58 Simplification rules
% 2.17/1.58 ----------------------
% 2.17/1.58 #Subsume : 2
% 2.17/1.58 #Demod : 3
% 2.17/1.58 #Tautology : 1
% 2.17/1.58 #SimpNegUnit : 3
% 2.17/1.58 #BackRed : 3
% 2.17/1.58
% 2.17/1.58 #Partial instantiations: 0
% 2.17/1.58 #Strategies tried : 1
% 2.17/1.58
% 2.17/1.58 Timing (in seconds)
% 2.17/1.58 ----------------------
% 2.17/1.59 Preprocessing : 0.37
% 2.17/1.59 Parsing : 0.21
% 2.17/1.59 CNF conversion : 0.02
% 2.17/1.59 Main loop : 0.17
% 2.17/1.59 Inferencing : 0.08
% 2.17/1.59 Reduction : 0.02
% 2.17/1.59 Demodulation : 0.02
% 2.17/1.59 BG Simplification : 0.01
% 2.17/1.59 Subsumption : 0.04
% 2.17/1.59 Abstraction : 0.01
% 2.17/1.59 MUC search : 0.00
% 2.17/1.59 Cooper : 0.00
% 2.17/1.59 Total : 0.58
% 2.17/1.59 Index Insertion : 0.00
% 2.17/1.59 Index Deletion : 0.00
% 2.17/1.59 Index Matching : 0.00
% 2.17/1.59 BG Taut test : 0.00
%------------------------------------------------------------------------------