TSTP Solution File: SYN366+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN366+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 : n010.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:38 EDT 2023
% Result : Theorem 2.64s 1.68s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 11 ( 4 ~; 2 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 12 (; 11 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_r > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_r,type,
big_r: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_41,negated_conjecture,
~ ( ( ! [U,V] :
( big_r(U,U)
<=> big_r(U,V) )
& ! [W,Z] :
( big_r(W,W)
<=> big_r(Z,W) ) )
=> ( ? [X] : big_r(X,X)
=> ! [Y] : big_r(Y,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2117) ).
tff(c_4,plain,
big_r('#skF_1','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_13,plain,
! [U_5,V_6] :
( big_r(U_5,V_6)
| ~ big_r(U_5,U_5) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_16,plain,
! [V_6] : big_r('#skF_1',V_6),
inference(resolution,[status(thm)],[c_4,c_13]) ).
tff(c_29,plain,
! [W_10,Z_11] :
( big_r(W_10,W_10)
| ~ big_r(Z_11,W_10) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_32,plain,
! [V_6] : big_r(V_6,V_6),
inference(resolution,[status(thm)],[c_16,c_29]) ).
tff(c_2,plain,
~ big_r('#skF_2','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_39,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN366+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.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:23:58 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.64/1.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.64/1.69
% 2.64/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.64/1.72
% 2.64/1.72 Inference rules
% 2.64/1.72 ----------------------
% 2.64/1.72 #Ref : 0
% 2.64/1.72 #Sup : 4
% 2.64/1.72 #Fact : 0
% 2.64/1.72 #Define : 0
% 2.64/1.72 #Split : 0
% 2.64/1.72 #Chain : 0
% 2.64/1.72 #Close : 0
% 2.64/1.72
% 2.64/1.72 Ordering : KBO
% 2.64/1.72
% 2.64/1.72 Simplification rules
% 2.64/1.72 ----------------------
% 2.64/1.72 #Subsume : 0
% 2.64/1.72 #Demod : 7
% 2.64/1.72 #Tautology : 5
% 2.64/1.72 #SimpNegUnit : 0
% 2.64/1.72 #BackRed : 2
% 2.64/1.72
% 2.64/1.72 #Partial instantiations: 0
% 2.64/1.72 #Strategies tried : 1
% 2.64/1.72
% 2.64/1.72 Timing (in seconds)
% 2.64/1.72 ----------------------
% 2.64/1.72 Preprocessing : 0.43
% 2.64/1.72 Parsing : 0.23
% 2.64/1.72 CNF conversion : 0.02
% 2.64/1.72 Main loop : 0.14
% 2.64/1.72 Inferencing : 0.05
% 2.64/1.72 Reduction : 0.03
% 2.64/1.72 Demodulation : 0.02
% 2.64/1.72 BG Simplification : 0.01
% 2.64/1.72 Subsumption : 0.04
% 2.64/1.73 Abstraction : 0.01
% 2.64/1.73 MUC search : 0.00
% 2.89/1.73 Cooper : 0.00
% 2.89/1.73 Total : 0.63
% 2.89/1.73 Index Insertion : 0.00
% 2.89/1.73 Index Deletion : 0.00
% 2.89/1.73 Index Matching : 0.00
% 2.89/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------