TSTP Solution File: SYN727+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN727+1 : TPTP v8.1.2. Released v2.5.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:11:44 EDT 2023
% Result : Theorem 2.37s 1.52s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 10 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 1 |; 1 &)
% ( 0 <=>; 2 =>; 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 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 10 (; 8 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ likes > #nlpp > lyle > bruce > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(likes,type,
likes: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(lyle,type,
lyle: $i ).
tff(bruce,type,
bruce: $i ).
tff(f_37,negated_conjecture,
~ ( ( ! [X] : likes(X,bruce)
& ! [Y] :
( ? [Z] : likes(Y,Z)
=> likes(lyle,Y) ) )
=> ? [U] :
! [V] : likes(U,V) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm68) ).
tff(c_6,plain,
! [X_1] : likes(X_1,bruce),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_9,plain,
! [Y_9,Z_10] :
( likes(lyle,Y_9)
| ~ likes(Y_9,Z_10) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_14,plain,
! [X_11] : likes(lyle,X_11),
inference(resolution,[status(thm)],[c_6,c_9]) ).
tff(c_2,plain,
! [U_5] : ~ likes(U_5,'#skF_1'(U_5)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_19,plain,
$false,
inference(resolution,[status(thm)],[c_14,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN727+1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/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.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 17:35:49 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.37/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.50/1.53
% 2.50/1.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.50/1.56
% 2.50/1.56 Inference rules
% 2.50/1.56 ----------------------
% 2.50/1.56 #Ref : 0
% 2.50/1.56 #Sup : 2
% 2.50/1.56 #Fact : 0
% 2.50/1.56 #Define : 0
% 2.50/1.56 #Split : 0
% 2.50/1.56 #Chain : 0
% 2.50/1.56 #Close : 0
% 2.50/1.56
% 2.50/1.56 Ordering : KBO
% 2.50/1.56
% 2.50/1.56 Simplification rules
% 2.50/1.56 ----------------------
% 2.50/1.56 #Subsume : 0
% 2.50/1.56 #Demod : 1
% 2.50/1.56 #Tautology : 1
% 2.50/1.56 #SimpNegUnit : 0
% 2.50/1.56 #BackRed : 0
% 2.50/1.56
% 2.50/1.56 #Partial instantiations: 0
% 2.50/1.56 #Strategies tried : 1
% 2.50/1.56
% 2.50/1.56 Timing (in seconds)
% 2.50/1.56 ----------------------
% 2.50/1.57 Preprocessing : 0.38
% 2.50/1.57 Parsing : 0.21
% 2.50/1.57 CNF conversion : 0.02
% 2.50/1.57 Main loop : 0.13
% 2.50/1.57 Inferencing : 0.06
% 2.50/1.57 Reduction : 0.02
% 2.50/1.57 Demodulation : 0.02
% 2.50/1.57 BG Simplification : 0.01
% 2.50/1.57 Subsumption : 0.03
% 2.50/1.57 Abstraction : 0.00
% 2.50/1.57 MUC search : 0.00
% 2.50/1.57 Cooper : 0.00
% 2.50/1.57 Total : 0.56
% 2.50/1.57 Index Insertion : 0.00
% 2.50/1.57 Index Deletion : 0.00
% 2.50/1.57 Index Matching : 0.00
% 2.50/1.57 BG Taut test : 0.00
%------------------------------------------------------------------------------