TSTP Solution File: SYN965+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN965+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/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 : n023.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:00 EDT 2023
% Result : Theorem 2.67s 1.60s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 12 ( 4 ~; 4 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 18 (; 15 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(p,type,
p: ( $i * $i ) > $o ).
tff(f_38,negated_conjecture,
~ ? [Z] :
! [X] :
? [Y] :
( ( p(Y,X)
=> ? [W] : p(W,Y) )
& ( ( p(Z,Y)
& p(Y,Z) )
=> p(Y,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_22,plain,
! [Y_23,Z_24] :
( p(Y_23,'#skF_1'(Z_24))
| p(Y_23,Z_24) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_6,plain,
! [W_14,Y_12,Z_1] :
( ~ p(W_14,Y_12)
| p(Y_12,Z_1) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_27,plain,
! [Z_24,Z_1,Y_23] :
( p('#skF_1'(Z_24),Z_1)
| p(Y_23,Z_24) ),
inference(resolution,[status(thm)],[c_22,c_6]) ).
tff(c_88,plain,
! [Z_34] : p('#skF_1'(Z_34),Z_34),
inference(factorization,[status(thm),theory(equality)],[c_27]) ).
tff(c_96,plain,
! [Z_34,Z_1] : p(Z_34,Z_1),
inference(resolution,[status(thm)],[c_88,c_6]) ).
tff(c_2,plain,
! [W_14,Y_12,Z_1] :
( ~ p(W_14,Y_12)
| ~ p(Y_12,'#skF_1'(Z_1)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_108,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_96,c_96,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN965+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/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.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:33:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.67/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.67/1.60
% 2.67/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.64
% 2.78/1.64 Inference rules
% 2.78/1.64 ----------------------
% 2.78/1.64 #Ref : 0
% 2.78/1.64 #Sup : 21
% 2.78/1.64 #Fact : 2
% 2.78/1.64 #Define : 0
% 2.78/1.64 #Split : 0
% 2.78/1.64 #Chain : 0
% 2.78/1.64 #Close : 0
% 2.78/1.64
% 2.78/1.64 Ordering : KBO
% 2.78/1.64
% 2.78/1.64 Simplification rules
% 2.78/1.64 ----------------------
% 2.78/1.64 #Subsume : 4
% 2.78/1.64 #Demod : 13
% 2.78/1.64 #Tautology : 7
% 2.78/1.64 #SimpNegUnit : 0
% 2.78/1.64 #BackRed : 1
% 2.78/1.64
% 2.78/1.64 #Partial instantiations: 0
% 2.78/1.64 #Strategies tried : 1
% 2.78/1.64
% 2.78/1.64 Timing (in seconds)
% 2.78/1.64 ----------------------
% 2.78/1.64 Preprocessing : 0.39
% 2.78/1.64 Parsing : 0.22
% 2.78/1.64 CNF conversion : 0.03
% 2.78/1.64 Main loop : 0.19
% 2.78/1.64 Inferencing : 0.09
% 2.78/1.64 Reduction : 0.03
% 2.78/1.64 Demodulation : 0.02
% 2.78/1.64 BG Simplification : 0.01
% 2.78/1.64 Subsumption : 0.05
% 2.78/1.64 Abstraction : 0.01
% 2.78/1.64 MUC search : 0.00
% 2.78/1.64 Cooper : 0.00
% 2.78/1.64 Total : 0.63
% 2.78/1.64 Index Insertion : 0.00
% 2.78/1.64 Index Deletion : 0.00
% 2.78/1.64 Index Matching : 0.00
% 2.78/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------