TSTP Solution File: SYN941+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN941+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 : n015.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:16:55 EDT 2023
% Result : Theorem 2.51s 1.59s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 8 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 14 (; 12 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > p > #nlpp > f > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: $i > $o ).
tff(f,type,
f: $i > $i ).
tff(p,type,
p: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(r,type,
r: $i > $o ).
tff(f_40,negated_conjecture,
~ ! [B,C] :
( q(f(B))
=> ? [X,Y] :
( ( p(f(Y))
=> ( p(X)
& ( r(Y)
=> ( r(B)
& r(C) ) ) ) )
& q(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_4,plain,
! [Y_4,X_3] :
( p(f(Y_4))
| ~ q(X_3) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_9,plain,
! [X_3] : ~ q(X_3),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_2,plain,
q(f('#skF_1')),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_11,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9,c_2]) ).
tff(c_12,plain,
! [Y_4] : p(f(Y_4)),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_8,plain,
! [Y_4,X_3] :
( r(Y_4)
| ~ p(X_3)
| ~ q(X_3) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_15,plain,
! [X_6] :
( ~ p(X_6)
| ~ q(X_6) ),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_18,plain,
~ p(f('#skF_1')),
inference(resolution,[status(thm)],[c_2,c_15]) ).
tff(c_22,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).
tff(c_23,plain,
! [Y_4] : r(Y_4),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_6,plain,
! [X_3] :
( ~ r('#skF_2')
| ~ r('#skF_1')
| ~ p(X_3)
| ~ q(X_3) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_27,plain,
! [X_8] :
( ~ p(X_8)
| ~ q(X_8) ),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_23,c_6]) ).
tff(c_30,plain,
~ p(f('#skF_1')),
inference(resolution,[status(thm)],[c_2,c_27]) ).
tff(c_34,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN941+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/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.14/0.36 % Computer : n015.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:46:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.51/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.51/1.60
% 2.51/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.51/1.62
% 2.51/1.62 Inference rules
% 2.51/1.62 ----------------------
% 2.51/1.62 #Ref : 0
% 2.51/1.62 #Sup : 2
% 2.51/1.62 #Fact : 0
% 2.51/1.62 #Define : 0
% 2.51/1.62 #Split : 2
% 2.51/1.62 #Chain : 0
% 2.51/1.62 #Close : 0
% 2.51/1.62
% 2.51/1.62 Ordering : KBO
% 2.51/1.62
% 2.51/1.62 Simplification rules
% 2.51/1.62 ----------------------
% 2.51/1.62 #Subsume : 0
% 2.51/1.62 #Demod : 4
% 2.51/1.62 #Tautology : 0
% 2.51/1.62 #SimpNegUnit : 1
% 2.51/1.62 #BackRed : 1
% 2.51/1.62
% 2.51/1.62 #Partial instantiations: 0
% 2.51/1.62 #Strategies tried : 1
% 2.51/1.62
% 2.51/1.62 Timing (in seconds)
% 2.51/1.62 ----------------------
% 2.51/1.63 Preprocessing : 0.40
% 2.51/1.63 Parsing : 0.23
% 2.51/1.63 CNF conversion : 0.02
% 2.51/1.63 Main loop : 0.15
% 2.51/1.63 Inferencing : 0.07
% 2.51/1.63 Reduction : 0.03
% 2.51/1.63 Demodulation : 0.02
% 2.51/1.63 BG Simplification : 0.01
% 2.51/1.63 Subsumption : 0.02
% 2.51/1.63 Abstraction : 0.00
% 2.51/1.63 MUC search : 0.00
% 2.51/1.63 Cooper : 0.00
% 2.51/1.63 Total : 0.60
% 2.51/1.63 Index Insertion : 0.00
% 2.51/1.63 Index Deletion : 0.00
% 2.51/1.63 Index Matching : 0.00
% 2.51/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------