TSTP Solution File: SYN920+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN920+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 : n014.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:51 EDT 2023
% Result : Theorem 2.82s 1.69s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 16 unt; 5 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 63 ( 29 ~; 21 |; 6 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 14 (; 12 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ h > g > f > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(g,type,
g: $i > $o ).
tff(f,type,
f: $i > $o ).
tff(f_63,negated_conjecture,
~ ( ( ( ! [X] :
( ( f(X)
& g(X) )
=> h(X) )
=> ? [X] :
( f(X)
& ~ g(X) ) )
& ( ! [W] :
( f(W)
=> g(W) )
| ! [Z] :
( f(Z)
=> h(Z) ) ) )
=> ( ! [R] :
( ( f(R)
& h(R) )
=> g(R) )
=> ? [V] :
( f(V)
& g(V)
& ~ h(V) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_18,plain,
( f('#skF_1')
| f('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_19,plain,
f('#skF_2'),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_6,plain,
! [Z_2,W_1] :
( h(Z_2)
| ~ f(Z_2)
| g(W_1)
| ~ f(W_1) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_30,plain,
! [W_7] :
( g(W_7)
| ~ f(W_7) ),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_12,plain,
( f('#skF_1')
| ~ g('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_21,plain,
~ g('#skF_2'),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_33,plain,
~ f('#skF_2'),
inference(resolution,[status(thm)],[c_30,c_21]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_33]) ).
tff(c_39,plain,
! [Z_8] :
( h(Z_8)
| ~ f(Z_8) ),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_4,plain,
! [R_3] :
( g(R_3)
| ~ h(R_3)
| ~ f(R_3) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_44,plain,
! [Z_9] :
( g(Z_9)
| ~ f(Z_9) ),
inference(resolution,[status(thm)],[c_39,c_4]) ).
tff(c_47,plain,
~ f('#skF_2'),
inference(resolution,[status(thm)],[c_44,c_21]) ).
tff(c_51,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_19,c_47]) ).
tff(c_52,plain,
f('#skF_1'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_53,plain,
g('#skF_2'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_10,plain,
( g('#skF_1')
| ~ g('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_55,plain,
g('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_53,c_10]) ).
tff(c_60,plain,
! [V_11] :
( h(V_11)
| ~ g(V_11)
| ~ f(V_11) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_8,plain,
( ~ h('#skF_1')
| ~ g('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_57,plain,
~ h('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_53,c_8]) ).
tff(c_66,plain,
( ~ g('#skF_1')
| ~ f('#skF_1') ),
inference(resolution,[status(thm)],[c_60,c_57]) ).
tff(c_71,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_52,c_55,c_66]) ).
tff(c_72,plain,
f('#skF_1'),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_73,plain,
~ f('#skF_2'),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_16,plain,
( g('#skF_1')
| f('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_77,plain,
g('#skF_1'),
inference(negUnitSimplification,[status(thm)],[c_73,c_16]) ).
tff(c_79,plain,
! [V_13] :
( h(V_13)
| ~ g(V_13)
| ~ f(V_13) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_14,plain,
( ~ h('#skF_1')
| f('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_76,plain,
~ h('#skF_1'),
inference(negUnitSimplification,[status(thm)],[c_73,c_14]) ).
tff(c_85,plain,
( ~ g('#skF_1')
| ~ f('#skF_1') ),
inference(resolution,[status(thm)],[c_79,c_76]) ).
tff(c_90,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_72,c_77,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN920+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % 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.18/0.35 % Computer : n014.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 17:15:48 EDT 2023
% 0.18/0.35 % CPUTime :
% 2.82/1.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.82/1.69
% 2.82/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.00/1.72
% 3.00/1.72 Inference rules
% 3.00/1.72 ----------------------
% 3.00/1.72 #Ref : 0
% 3.00/1.72 #Sup : 8
% 3.00/1.72 #Fact : 0
% 3.00/1.72 #Define : 0
% 3.00/1.72 #Split : 4
% 3.00/1.72 #Chain : 0
% 3.00/1.72 #Close : 0
% 3.00/1.72
% 3.00/1.72 Ordering : KBO
% 3.00/1.72
% 3.00/1.72 Simplification rules
% 3.00/1.72 ----------------------
% 3.00/1.72 #Subsume : 8
% 3.00/1.72 #Demod : 12
% 3.00/1.72 #Tautology : 5
% 3.00/1.72 #SimpNegUnit : 2
% 3.00/1.72 #BackRed : 0
% 3.00/1.72
% 3.00/1.72 #Partial instantiations: 0
% 3.00/1.72 #Strategies tried : 1
% 3.00/1.72
% 3.00/1.72 Timing (in seconds)
% 3.00/1.72 ----------------------
% 3.00/1.73 Preprocessing : 0.43
% 3.00/1.73 Parsing : 0.24
% 3.00/1.73 CNF conversion : 0.03
% 3.00/1.73 Main loop : 0.21
% 3.00/1.73 Inferencing : 0.09
% 3.00/1.73 Reduction : 0.04
% 3.00/1.73 Demodulation : 0.02
% 3.00/1.73 BG Simplification : 0.02
% 3.00/1.73 Subsumption : 0.05
% 3.00/1.73 Abstraction : 0.01
% 3.00/1.73 MUC search : 0.00
% 3.00/1.73 Cooper : 0.00
% 3.00/1.73 Total : 0.70
% 3.00/1.73 Index Insertion : 0.00
% 3.00/1.73 Index Deletion : 0.00
% 3.00/1.73 Index Matching : 0.00
% 3.00/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------