TSTP Solution File: SYN318+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN318+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 : n015.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:24 EDT 2023
% Result : Theorem 2.32s 1.55s
% Output : CNFRefutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 3 |; 0 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 11 (; 10 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_g > big_f > #nlpp > p > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(big_g,type,
big_g: $i > $o ).
tff(big_f,type,
big_f: $i > $o ).
tff(f_39,negated_conjecture,
~ ? [Y] :
( ! [X] :
( big_f(X)
=> ( big_f(Y)
=> big_g(X) ) )
=> ( p
=> ! [X] :
( big_f(X)
=> big_g(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_4) ).
tff(c_6,plain,
! [Y_1] : ~ big_g(Y_1),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_2,plain,
! [X_4,Y_1] :
( big_g(X_4)
| ~ big_f(Y_1)
| ~ big_f(X_4) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_9,plain,
! [Y_1,X_4] :
( ~ big_f(Y_1)
| ~ big_f(X_4) ),
inference(negUnitSimplification,[status(thm)],[c_6,c_2]) ).
tff(c_12,plain,
! [X_4] : ~ big_f(X_4),
inference(splitLeft,[status(thm)],[c_9]) ).
tff(c_8,plain,
! [Y_1] : big_f('#skF_1'(Y_1)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_14,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_8]) ).
tff(c_15,plain,
! [Y_1] : ~ big_f(Y_1),
inference(splitRight,[status(thm)],[c_9]) ).
tff(c_17,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_15,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN318+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % 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.17/0.36 % Computer : n015.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Thu Aug 3 17:36:29 EDT 2023
% 0.17/0.36 % CPUTime :
% 2.32/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.32/1.56
% 2.32/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.32/1.59
% 2.32/1.59 Inference rules
% 2.32/1.59 ----------------------
% 2.32/1.59 #Ref : 0
% 2.32/1.59 #Sup : 0
% 2.32/1.59 #Fact : 0
% 2.32/1.59 #Define : 0
% 2.32/1.59 #Split : 1
% 2.32/1.59 #Chain : 0
% 2.32/1.59 #Close : 0
% 2.32/1.60
% 2.32/1.60 Ordering : KBO
% 2.32/1.60
% 2.32/1.60 Simplification rules
% 2.32/1.60 ----------------------
% 2.32/1.60 #Subsume : 0
% 2.32/1.60 #Demod : 0
% 2.32/1.60 #Tautology : 0
% 2.32/1.60 #SimpNegUnit : 3
% 2.32/1.60 #BackRed : 2
% 2.32/1.60
% 2.32/1.60 #Partial instantiations: 0
% 2.32/1.60 #Strategies tried : 1
% 2.32/1.60
% 2.32/1.60 Timing (in seconds)
% 2.32/1.60 ----------------------
% 2.32/1.60 Preprocessing : 0.39
% 2.32/1.60 Parsing : 0.21
% 2.32/1.60 CNF conversion : 0.03
% 2.32/1.60 Main loop : 0.11
% 2.32/1.60 Inferencing : 0.03
% 2.32/1.60 Reduction : 0.03
% 2.32/1.60 Demodulation : 0.02
% 2.32/1.60 BG Simplification : 0.01
% 2.32/1.60 Subsumption : 0.02
% 2.32/1.60 Abstraction : 0.00
% 2.32/1.60 MUC search : 0.00
% 2.32/1.60 Cooper : 0.00
% 2.32/1.60 Total : 0.56
% 2.32/1.60 Index Insertion : 0.00
% 2.32/1.60 Index Deletion : 0.00
% 2.32/1.60 Index Matching : 0.00
% 2.32/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------