TSTP Solution File: SYN346+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN346+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 : n025.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.01s 1.50s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 10 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 10 ( 4 ~; 2 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 11 (; 9 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > #skF_3 > #skF_2 > #skF_1 > #skF_4
%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('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_39,negated_conjecture,
~ ! [X1,X2] :
? [Y1,Y2] :
! [Z1,Z2] :
( big_f(X2,Z1)
=> ( big_f(Y1,Z2)
=> ( ( big_f(Y1,Z1)
& big_f(Y2,Z1) )
| ( big_f(X2,Z2)
& big_f(Y2,Z2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_17_2) ).
tff(c_8,plain,
! [Y1_7,Y2_8] : big_f('#skF_2','#skF_3'(Y1_7,Y2_8)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_11,plain,
! [Y2_15,Y1_16] :
( ~ big_f(Y2_15,'#skF_3'(Y1_16,Y2_15))
| ~ big_f(Y1_16,'#skF_3'(Y1_16,Y2_15)) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_16,plain,
! [Y1_17] : ~ big_f(Y1_17,'#skF_3'(Y1_17,'#skF_2')),
inference(resolution,[status(thm)],[c_8,c_11]) ).
tff(c_21,plain,
$false,
inference(resolution,[status(thm)],[c_8,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN346+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/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.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 17:36:04 EDT 2023
% 0.12/0.34 % CPUTime :
% 2.01/1.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.01/1.51
% 2.01/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.51/1.54
% 2.51/1.54 Inference rules
% 2.51/1.54 ----------------------
% 2.51/1.54 #Ref : 0
% 2.51/1.54 #Sup : 2
% 2.51/1.54 #Fact : 0
% 2.51/1.54 #Define : 0
% 2.51/1.54 #Split : 0
% 2.51/1.54 #Chain : 0
% 2.51/1.54 #Close : 0
% 2.51/1.54
% 2.51/1.54 Ordering : KBO
% 2.51/1.54
% 2.51/1.54 Simplification rules
% 2.51/1.54 ----------------------
% 2.51/1.54 #Subsume : 0
% 2.51/1.54 #Demod : 0
% 2.51/1.54 #Tautology : 0
% 2.51/1.54 #SimpNegUnit : 0
% 2.51/1.54 #BackRed : 0
% 2.51/1.54
% 2.51/1.54 #Partial instantiations: 0
% 2.51/1.54 #Strategies tried : 1
% 2.51/1.54
% 2.51/1.54 Timing (in seconds)
% 2.51/1.54 ----------------------
% 2.51/1.54 Preprocessing : 0.37
% 2.51/1.54 Parsing : 0.21
% 2.51/1.54 CNF conversion : 0.03
% 2.51/1.54 Main loop : 0.12
% 2.51/1.54 Inferencing : 0.05
% 2.51/1.54 Reduction : 0.02
% 2.51/1.54 Demodulation : 0.02
% 2.51/1.54 BG Simplification : 0.01
% 2.51/1.54 Subsumption : 0.03
% 2.51/1.54 Abstraction : 0.00
% 2.51/1.54 MUC search : 0.00
% 2.51/1.54 Cooper : 0.00
% 2.51/1.54 Total : 0.54
% 2.51/1.55 Index Insertion : 0.00
% 2.51/1.55 Index Deletion : 0.00
% 2.51/1.55 Index Matching : 0.00
% 2.51/1.55 BG Taut test : 0.00
%------------------------------------------------------------------------------