TSTP Solution File: SYN352+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN352+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/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 : 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:35 EDT 2023
% Result : Theorem 2.81s 1.66s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 3 unt; 4 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 26 ( 9 ~; 8 |; 1 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 16 (; 14 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_49,negated_conjecture,
~ ! [X1,X2] :
? [Y1,Y2] :
! [Z] :
( big_f(X1,X2)
=> ( ( big_f(Y1,Y2)
=> ( big_f(X2,Z)
| big_f(Y2,Z) ) )
=> ( ( ( big_f(Y1,Y2)
=> ( big_f(X2,Z)
<=> big_f(Y1,Z) ) )
=> big_f(Z,Z) )
=> ( big_f(Y1,Y2)
& ( big_f(Y1,Z)
<=> big_f(Y2,Z) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_18_4) ).
tff(c_12,plain,
! [Y1_5,Y2_6] :
( big_f(Y1_5,'#skF_3'(Y1_5,Y2_6))
| big_f(Y2_6,'#skF_3'(Y1_5,Y2_6))
| ~ big_f(Y1_5,Y2_6) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_36,plain,
! [Y1_5] :
( ~ big_f(Y1_5,Y1_5)
| big_f(Y1_5,'#skF_3'(Y1_5,Y1_5)) ),
inference(factorization,[status(thm),theory(equality)],[c_12]) ).
tff(c_40,plain,
! [Y2_13,Y1_14] :
( ~ big_f(Y2_13,'#skF_3'(Y1_14,Y2_13))
| ~ big_f(Y1_14,'#skF_3'(Y1_14,Y2_13))
| ~ big_f(Y1_14,Y2_13) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_48,plain,
! [Y1_15] :
( ~ big_f(Y1_15,'#skF_3'(Y1_15,Y1_15))
| ~ big_f(Y1_15,Y1_15) ),
inference(resolution,[status(thm)],[c_36,c_40]) ).
tff(c_56,plain,
! [Y1_5] : ~ big_f(Y1_5,Y1_5),
inference(resolution,[status(thm)],[c_36,c_48]) ).
tff(c_14,plain,
! [Y1_5,Y2_6] :
( big_f(Y1_5,Y2_6)
| big_f('#skF_3'(Y1_5,Y2_6),'#skF_3'(Y1_5,Y2_6)) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_57,plain,
! [Y1_5,Y2_6] : big_f(Y1_5,Y2_6),
inference(negUnitSimplification,[status(thm)],[c_56,c_14]) ).
tff(c_66,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_57,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN352+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n005.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 17:10:56 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.81/1.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.81/1.66
% 2.81/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.81/1.70
% 2.81/1.70 Inference rules
% 2.81/1.70 ----------------------
% 2.81/1.70 #Ref : 0
% 2.81/1.70 #Sup : 3
% 2.81/1.70 #Fact : 2
% 2.81/1.70 #Define : 0
% 2.81/1.70 #Split : 0
% 2.81/1.70 #Chain : 0
% 2.81/1.70 #Close : 0
% 2.81/1.70
% 2.81/1.70 Ordering : KBO
% 2.81/1.70
% 2.81/1.70 Simplification rules
% 2.81/1.70 ----------------------
% 2.81/1.70 #Subsume : 3
% 2.81/1.70 #Demod : 8
% 2.81/1.70 #Tautology : 7
% 2.81/1.70 #SimpNegUnit : 1
% 2.81/1.70 #BackRed : 3
% 2.81/1.70
% 2.81/1.70 #Partial instantiations: 0
% 2.81/1.70 #Strategies tried : 1
% 2.81/1.70
% 2.81/1.70 Timing (in seconds)
% 2.81/1.70 ----------------------
% 2.81/1.70 Preprocessing : 0.43
% 2.81/1.70 Parsing : 0.23
% 2.81/1.70 CNF conversion : 0.03
% 2.81/1.70 Main loop : 0.19
% 2.81/1.70 Inferencing : 0.09
% 2.81/1.70 Reduction : 0.04
% 2.81/1.70 Demodulation : 0.03
% 2.81/1.70 BG Simplification : 0.02
% 2.81/1.70 Subsumption : 0.04
% 2.81/1.70 Abstraction : 0.01
% 2.81/1.70 MUC search : 0.00
% 2.81/1.70 Cooper : 0.00
% 2.81/1.70 Total : 0.67
% 2.81/1.70 Index Insertion : 0.00
% 2.81/1.70 Index Deletion : 0.00
% 2.81/1.70 Index Matching : 0.00
% 2.81/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------