TSTP Solution File: SYN396+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN396+1 : TPTP v8.1.2. Released v2.0.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 : n005.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:10:45 EDT 2023
% Result : Theorem 2.08s 1.44s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 14 unt; 3 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 11 ~; 4 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 (; 9 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f,type,
f: $i > $o ).
tff(f_33,negated_conjecture,
~ ( ~ ! [X] : f(X)
<=> ? [Y] : ~ f(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish203) ).
tff(c_2,plain,
! [Y_1,X_2] :
( f(Y_1)
| f(X_2) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_11,plain,
! [X_2] : f(X_2),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_4,plain,
! [X_2] :
( ~ f('#skF_1')
| f(X_2) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_10,plain,
~ f('#skF_1'),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_16,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_11,c_10]) ).
tff(c_17,plain,
! [Y_1] : f(Y_1),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_22,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_10]) ).
tff(c_23,plain,
! [X_2] : f(X_2),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_8,plain,
( ~ f('#skF_1')
| ~ f('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_9,plain,
~ f('#skF_2'),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_27,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_23,c_9]) ).
tff(c_29,plain,
f('#skF_2'),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_6,plain,
! [Y_1] :
( f(Y_1)
| ~ f('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_30,plain,
~ f('#skF_2'),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_32,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_29,c_30]) ).
tff(c_33,plain,
! [Y_1] : f(Y_1),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_28,plain,
~ f('#skF_1'),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_39,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_33,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN396+1 : TPTP v8.1.2. Released v2.0.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.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:15:12 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.08/1.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/1.45
% 2.08/1.45 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.08/1.49
% 2.08/1.49 Inference rules
% 2.08/1.49 ----------------------
% 2.08/1.49 #Ref : 0
% 2.08/1.49 #Sup : 0
% 2.08/1.49 #Fact : 0
% 2.08/1.49 #Define : 0
% 2.08/1.49 #Split : 4
% 2.08/1.49 #Chain : 0
% 2.08/1.49 #Close : 0
% 2.08/1.49
% 2.08/1.49 Ordering : KBO
% 2.08/1.49
% 2.08/1.49 Simplification rules
% 2.08/1.49 ----------------------
% 2.08/1.49 #Subsume : 1
% 2.08/1.49 #Demod : 9
% 2.08/1.49 #Tautology : 2
% 2.08/1.49 #SimpNegUnit : 0
% 2.08/1.49 #BackRed : 5
% 2.08/1.49
% 2.08/1.49 #Partial instantiations: 0
% 2.08/1.49 #Strategies tried : 1
% 2.08/1.49
% 2.08/1.49 Timing (in seconds)
% 2.08/1.49 ----------------------
% 2.08/1.49 Preprocessing : 0.35
% 2.08/1.49 Parsing : 0.19
% 2.08/1.49 CNF conversion : 0.02
% 2.08/1.49 Main loop : 0.12
% 2.08/1.49 Inferencing : 0.03
% 2.08/1.49 Reduction : 0.02
% 2.08/1.49 Demodulation : 0.02
% 2.08/1.49 BG Simplification : 0.01
% 2.08/1.49 Subsumption : 0.03
% 2.08/1.49 Abstraction : 0.00
% 2.08/1.49 MUC search : 0.00
% 2.08/1.49 Cooper : 0.00
% 2.08/1.49 Total : 0.52
% 2.08/1.49 Index Insertion : 0.00
% 2.08/1.49 Index Deletion : 0.00
% 2.08/1.49 Index Matching : 0.00
% 2.08/1.49 BG Taut test : 0.00
%------------------------------------------------------------------------------