TSTP Solution File: SYN412+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN412+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 : 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:10:47 EDT 2023
% Result : Theorem 2.15s 1.59s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 6 unt; 2 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 7 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 (; 5 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f,type,
f: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_33,negated_conjecture,
~ ~ ? [X] :
! [Y] :
( f(X,Y)
<=> ~ f(X,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish255) ).
tff(c_4,plain,
! [Y_2] :
( f('#skF_1',Y_2)
| f('#skF_1','#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_5,plain,
f('#skF_1','#skF_1'),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_2,plain,
! [Y_2] :
( ~ f('#skF_1','#skF_1')
| ~ f('#skF_1',Y_2) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_7,plain,
! [Y_2] : ~ f('#skF_1',Y_2),
inference(demodulation,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_9,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_7,c_5]) ).
tff(c_10,plain,
! [Y_2] : f('#skF_1',Y_2),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_11,plain,
~ f('#skF_1','#skF_1'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_14,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN412+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % 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.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 17:04:18 EDT 2023
% 0.12/0.33 % CPUTime :
% 2.15/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.15/1.59
% 2.15/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.15/1.63
% 2.15/1.63 Inference rules
% 2.15/1.63 ----------------------
% 2.15/1.63 #Ref : 0
% 2.15/1.63 #Sup : 0
% 2.15/1.63 #Fact : 0
% 2.15/1.63 #Define : 0
% 2.15/1.63 #Split : 1
% 2.15/1.63 #Chain : 0
% 2.15/1.63 #Close : 0
% 2.15/1.63
% 2.15/1.63 Ordering : KBO
% 2.15/1.63
% 2.15/1.63 Simplification rules
% 2.15/1.63 ----------------------
% 2.15/1.63 #Subsume : 0
% 2.15/1.63 #Demod : 2
% 2.15/1.63 #Tautology : 0
% 2.15/1.63 #SimpNegUnit : 1
% 2.15/1.63 #BackRed : 1
% 2.15/1.63
% 2.15/1.63 #Partial instantiations: 0
% 2.15/1.63 #Strategies tried : 1
% 2.15/1.63
% 2.15/1.63 Timing (in seconds)
% 2.15/1.63 ----------------------
% 2.15/1.63 Preprocessing : 0.38
% 2.15/1.63 Parsing : 0.20
% 2.15/1.63 CNF conversion : 0.02
% 2.15/1.63 Main loop : 0.10
% 2.15/1.63 Inferencing : 0.03
% 2.15/1.63 Reduction : 0.02
% 2.15/1.63 Demodulation : 0.01
% 2.15/1.63 BG Simplification : 0.01
% 2.15/1.63 Subsumption : 0.02
% 2.15/1.63 Abstraction : 0.00
% 2.15/1.63 MUC search : 0.00
% 2.15/1.63 Cooper : 0.00
% 2.15/1.63 Total : 0.54
% 2.15/1.63 Index Insertion : 0.00
% 2.15/1.63 Index Deletion : 0.00
% 2.15/1.63 Index Matching : 0.00
% 2.15/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------