TSTP Solution File: SYN345+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN345+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 : n018.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:32 EDT 2023
% Result : Theorem 2.75s 1.71s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 17 unt; 4 typ; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 12 ( 1 avg)
% Number of connectives : 45 ( 20 ~; 14 |; 1 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 27 (; 25 !; 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 * $i ) > $o ).
tff(f_51,negated_conjecture,
~ ! [X1,X2] :
? [Y1,Y2] :
! [Z] :
( ( ( big_f(X1,X2,Y1)
=> big_f(Y2,Y1,Z) )
=> ( big_f(X1,X1,X2)
=> big_f(X1,X2,X2) ) )
=> ( ( ( big_f(X2,Y1,Y2)
=> big_f(Y1,Z,Z) )
=> ( big_f(X1,X2,X2)
=> big_f(X1,X1,X2) ) )
=> ( big_f(Y1,Y2,Z)
=> ( big_f(X2,X2,Y1)
& ( big_f(X1,X1,X2)
<=> big_f(X1,X2,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_16_4) ).
tff(c_2,plain,
! [Y1_5,Y2_6] : big_f(Y1_5,Y2_6,'#skF_3'(Y1_5,Y2_6)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_14,plain,
! [Y1_5,Y2_6] :
( big_f('#skF_2',Y1_5,Y2_6)
| big_f('#skF_1','#skF_1','#skF_2')
| ~ big_f('#skF_1','#skF_2','#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_20,plain,
~ big_f('#skF_1','#skF_2','#skF_2'),
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_18,plain,
! [Y1_5] :
( big_f('#skF_1','#skF_2',Y1_5)
| big_f('#skF_1','#skF_2','#skF_2')
| ~ big_f('#skF_1','#skF_1','#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_21,plain,
! [Y1_5] :
( big_f('#skF_1','#skF_2',Y1_5)
| ~ big_f('#skF_1','#skF_1','#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_20,c_18]) ).
tff(c_22,plain,
~ big_f('#skF_1','#skF_1','#skF_2'),
inference(splitLeft,[status(thm)],[c_21]) ).
tff(c_10,plain,
! [Y1_5] :
( big_f('#skF_1','#skF_1','#skF_2')
| big_f('#skF_1','#skF_2','#skF_2')
| ~ big_f('#skF_2','#skF_2',Y1_5) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_24,plain,
! [Y1_10] : ~ big_f('#skF_2','#skF_2',Y1_10),
inference(negUnitSimplification,[status(thm)],[c_20,c_22,c_10]) ).
tff(c_29,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_24]) ).
tff(c_30,plain,
! [Y1_5] : big_f('#skF_1','#skF_2',Y1_5),
inference(splitRight,[status(thm)],[c_21]) ).
tff(c_34,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_30,c_20]) ).
tff(c_35,plain,
! [Y1_5,Y2_6] :
( big_f('#skF_1','#skF_1','#skF_2')
| big_f('#skF_2',Y1_5,Y2_6) ),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_37,plain,
big_f('#skF_1','#skF_1','#skF_2'),
inference(splitLeft,[status(thm)],[c_35]) ).
tff(c_36,plain,
big_f('#skF_1','#skF_2','#skF_2'),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_4,plain,
! [Y1_5] :
( ~ big_f('#skF_1','#skF_2','#skF_2')
| ~ big_f('#skF_1','#skF_1','#skF_2')
| ~ big_f('#skF_2','#skF_2',Y1_5) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_39,plain,
! [Y1_5] :
( ~ big_f('#skF_1','#skF_1','#skF_2')
| ~ big_f('#skF_2','#skF_2',Y1_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_4]) ).
tff(c_40,plain,
~ big_f('#skF_1','#skF_1','#skF_2'),
inference(splitLeft,[status(thm)],[c_39]) ).
tff(c_42,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_37,c_40]) ).
tff(c_46,plain,
! [Y1_11] : ~ big_f('#skF_2','#skF_2',Y1_11),
inference(splitRight,[status(thm)],[c_39]) ).
tff(c_51,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_46]) ).
tff(c_52,plain,
! [Y1_5,Y2_6] : big_f('#skF_2',Y1_5,Y2_6),
inference(splitRight,[status(thm)],[c_35]) ).
tff(c_53,plain,
~ big_f('#skF_1','#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_35]) ).
tff(c_12,plain,
! [Y1_5,Y2_6] :
( ~ big_f(Y1_5,'#skF_3'(Y1_5,Y2_6),'#skF_3'(Y1_5,Y2_6))
| big_f('#skF_1','#skF_1','#skF_2')
| ~ big_f('#skF_1','#skF_2','#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_63,plain,
! [Y1_5,Y2_6] :
( ~ big_f(Y1_5,'#skF_3'(Y1_5,Y2_6),'#skF_3'(Y1_5,Y2_6))
| big_f('#skF_1','#skF_1','#skF_2') ),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_12]) ).
tff(c_65,plain,
! [Y1_14,Y2_15] : ~ big_f(Y1_14,'#skF_3'(Y1_14,Y2_15),'#skF_3'(Y1_14,Y2_15)),
inference(negUnitSimplification,[status(thm)],[c_53,c_63]) ).
tff(c_70,plain,
$false,
inference(resolution,[status(thm)],[c_52,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN345+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.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:24:20 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.75/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.75/1.71
% 2.75/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.75/1.75
% 2.75/1.75 Inference rules
% 2.75/1.75 ----------------------
% 2.75/1.75 #Ref : 0
% 2.75/1.75 #Sup : 3
% 2.75/1.75 #Fact : 0
% 2.75/1.75 #Define : 0
% 2.75/1.75 #Split : 4
% 2.75/1.75 #Chain : 0
% 2.75/1.75 #Close : 0
% 2.75/1.75
% 2.75/1.75 Ordering : KBO
% 2.75/1.75
% 2.75/1.75 Simplification rules
% 2.75/1.75 ----------------------
% 2.75/1.75 #Subsume : 3
% 2.75/1.75 #Demod : 11
% 2.75/1.75 #Tautology : 4
% 2.75/1.75 #SimpNegUnit : 4
% 2.75/1.75 #BackRed : 1
% 2.75/1.75
% 2.75/1.75 #Partial instantiations: 0
% 2.75/1.75 #Strategies tried : 1
% 2.75/1.75
% 2.75/1.75 Timing (in seconds)
% 2.75/1.75 ----------------------
% 2.75/1.75 Preprocessing : 0.42
% 2.75/1.75 Parsing : 0.23
% 2.75/1.75 CNF conversion : 0.03
% 2.75/1.75 Main loop : 0.16
% 2.75/1.75 Inferencing : 0.05
% 2.75/1.75 Reduction : 0.04
% 2.75/1.75 Demodulation : 0.03
% 2.75/1.75 BG Simplification : 0.01
% 2.75/1.75 Subsumption : 0.04
% 2.75/1.75 Abstraction : 0.01
% 2.75/1.75 MUC search : 0.00
% 2.75/1.75 Cooper : 0.00
% 2.75/1.75 Total : 0.64
% 2.75/1.75 Index Insertion : 0.00
% 2.75/1.75 Index Deletion : 0.00
% 2.75/1.75 Index Matching : 0.00
% 2.75/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------