TSTP Solution File: SYN347+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN347+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 : n019.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:33 EDT 2023
% Result : Theorem 2.85s 1.69s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 35 ( 16 ~; 16 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 28 (; 26 !; 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_38,negated_conjecture,
~ ! [Z1,Z2] :
? [X1,X2] :
! [Y] :
( ( ( big_f(X1,Y)
<=> big_f(X2,Y) )
<=> big_f(Z1,Z2) )
| ( big_f(Z1,Y)
<=> big_f(Z2,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_17_3) ).
tff(c_8,plain,
! [X1_5,X2_6] :
( big_f('#skF_1','#skF_3'(X1_5,X2_6))
| big_f('#skF_2','#skF_3'(X1_5,X2_6)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_36,plain,
! [X1_5,X2_6] :
( big_f(X1_5,'#skF_3'(X1_5,X2_6))
| ~ big_f(X2_6,'#skF_3'(X1_5,X2_6))
| big_f('#skF_1','#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_45,plain,
big_f('#skF_1','#skF_2'),
inference(splitLeft,[status(thm)],[c_36]) ).
tff(c_28,plain,
! [X1_5,X2_6] :
( ~ big_f('#skF_1','#skF_2')
| big_f(X1_5,'#skF_3'(X1_5,X2_6))
| big_f(X2_6,'#skF_3'(X1_5,X2_6)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_48,plain,
! [X1_5,X2_6] :
( big_f(X1_5,'#skF_3'(X1_5,X2_6))
| big_f(X2_6,'#skF_3'(X1_5,X2_6)) ),
inference(demodulation,[status(thm),theory(equality)],[c_45,c_28]) ).
tff(c_61,plain,
! [X1_5] : big_f(X1_5,'#skF_3'(X1_5,X1_5)),
inference(factorization,[status(thm),theory(equality)],[c_48]) ).
tff(c_10,plain,
! [X2_6,X1_5] :
( ~ big_f('#skF_1','#skF_2')
| ~ big_f(X2_6,'#skF_3'(X1_5,X2_6))
| ~ big_f(X1_5,'#skF_3'(X1_5,X2_6)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_83,plain,
! [X2_15,X1_16] :
( ~ big_f(X2_15,'#skF_3'(X1_16,X2_15))
| ~ big_f(X1_16,'#skF_3'(X1_16,X2_15)) ),
inference(demodulation,[status(thm),theory(equality)],[c_45,c_10]) ).
tff(c_85,plain,
! [X1_5] : ~ big_f(X1_5,'#skF_3'(X1_5,X1_5)),
inference(resolution,[status(thm)],[c_61,c_83]) ).
tff(c_95,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_61,c_85]) ).
tff(c_98,plain,
! [X1_17,X2_18] :
( big_f(X1_17,'#skF_3'(X1_17,X2_18))
| ~ big_f(X2_18,'#skF_3'(X1_17,X2_18)) ),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_102,plain,
! [X1_5] :
( big_f(X1_5,'#skF_3'(X1_5,'#skF_2'))
| big_f('#skF_1','#skF_3'(X1_5,'#skF_2')) ),
inference(resolution,[status(thm)],[c_8,c_98]) ).
tff(c_115,plain,
big_f('#skF_1','#skF_3'('#skF_1','#skF_2')),
inference(factorization,[status(thm),theory(equality)],[c_102]) ).
tff(c_97,plain,
~ big_f('#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_38,plain,
! [X2_6,X1_5] :
( big_f(X2_6,'#skF_3'(X1_5,X2_6))
| ~ big_f(X1_5,'#skF_3'(X1_5,X2_6))
| big_f('#skF_1','#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_129,plain,
! [X2_20,X1_21] :
( big_f(X2_20,'#skF_3'(X1_21,X2_20))
| ~ big_f(X1_21,'#skF_3'(X1_21,X2_20)) ),
inference(negUnitSimplification,[status(thm)],[c_97,c_38]) ).
tff(c_138,plain,
big_f('#skF_2','#skF_3'('#skF_1','#skF_2')),
inference(resolution,[status(thm)],[c_115,c_129]) ).
tff(c_2,plain,
! [X1_5,X2_6] :
( ~ big_f('#skF_2','#skF_3'(X1_5,X2_6))
| ~ big_f('#skF_1','#skF_3'(X1_5,X2_6)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_145,plain,
~ big_f('#skF_1','#skF_3'('#skF_1','#skF_2')),
inference(resolution,[status(thm)],[c_138,c_2]) ).
tff(c_151,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_115,c_145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN347+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/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.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:20:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.85/1.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.69
% 2.85/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.85/1.72
% 2.85/1.72 Inference rules
% 2.85/1.72 ----------------------
% 2.85/1.72 #Ref : 0
% 2.85/1.72 #Sup : 15
% 2.85/1.72 #Fact : 4
% 2.85/1.72 #Define : 0
% 2.85/1.72 #Split : 1
% 2.85/1.72 #Chain : 0
% 2.85/1.72 #Close : 0
% 2.85/1.72
% 2.85/1.72 Ordering : KBO
% 2.85/1.72
% 2.85/1.72 Simplification rules
% 2.85/1.72 ----------------------
% 2.85/1.72 #Subsume : 2
% 2.85/1.72 #Demod : 8
% 2.85/1.72 #Tautology : 19
% 2.85/1.72 #SimpNegUnit : 1
% 2.85/1.72 #BackRed : 0
% 2.85/1.72
% 2.85/1.72 #Partial instantiations: 0
% 2.85/1.72 #Strategies tried : 1
% 2.85/1.72
% 2.85/1.72 Timing (in seconds)
% 2.85/1.72 ----------------------
% 2.85/1.72 Preprocessing : 0.42
% 2.85/1.72 Parsing : 0.22
% 2.85/1.72 CNF conversion : 0.04
% 2.85/1.72 Main loop : 0.23
% 2.85/1.72 Inferencing : 0.11
% 2.85/1.72 Reduction : 0.03
% 2.85/1.72 Demodulation : 0.02
% 2.85/1.72 BG Simplification : 0.02
% 2.85/1.72 Subsumption : 0.06
% 2.85/1.72 Abstraction : 0.01
% 2.85/1.72 MUC search : 0.00
% 2.85/1.72 Cooper : 0.00
% 2.85/1.72 Total : 0.70
% 2.85/1.72 Index Insertion : 0.00
% 2.85/1.72 Index Deletion : 0.00
% 2.85/1.72 Index Matching : 0.00
% 2.85/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------