TSTP Solution File: SYN381+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN381+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 : n012.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:41 EDT 2023
% Result : Theorem 2.07s 1.52s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 15 ( 4 ~; 6 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 15 (; 13 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(big_q,type,
big_q: ( $i * $i ) > $o ).
tff(f_45,negated_conjecture,
~ ( ( ! [X] :
( ? [Y] : big_q(X,Y)
=> big_p(X) )
& ! [V] :
? [U] : big_q(U,V)
& ! [W,Z] :
( big_q(W,Z)
=> ( big_q(Z,W)
| big_q(Z,Z) ) ) )
=> ! [Z] : big_p(Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2133) ).
tff(c_6,plain,
! [V_4] : big_q('#skF_1'(V_4),V_4),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_16,plain,
! [Z_12,W_13] :
( big_q(Z_12,Z_12)
| big_q(Z_12,W_13)
| ~ big_q(W_13,Z_12) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_20,plain,
! [V_14] :
( big_q(V_14,V_14)
| big_q(V_14,'#skF_1'(V_14)) ),
inference(resolution,[status(thm)],[c_6,c_16]) ).
tff(c_8,plain,
! [X_1,Y_3] :
( big_p(X_1)
| ~ big_q(X_1,Y_3) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_29,plain,
! [V_15] :
( big_p(V_15)
| big_q(V_15,V_15) ),
inference(resolution,[status(thm)],[c_20,c_8]) ).
tff(c_36,plain,
! [V_15] : big_p(V_15),
inference(resolution,[status(thm)],[c_29,c_8]) ).
tff(c_2,plain,
~ big_p('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_42,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN381+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.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:15:37 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.07/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.48/1.52
% 2.48/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.48/1.55
% 2.48/1.55 Inference rules
% 2.48/1.55 ----------------------
% 2.48/1.55 #Ref : 0
% 2.48/1.55 #Sup : 6
% 2.48/1.55 #Fact : 0
% 2.48/1.55 #Define : 0
% 2.48/1.55 #Split : 0
% 2.48/1.55 #Chain : 0
% 2.48/1.55 #Close : 0
% 2.48/1.55
% 2.48/1.55 Ordering : KBO
% 2.48/1.55
% 2.48/1.55 Simplification rules
% 2.48/1.55 ----------------------
% 2.48/1.55 #Subsume : 1
% 2.48/1.55 #Demod : 5
% 2.48/1.55 #Tautology : 4
% 2.48/1.55 #SimpNegUnit : 0
% 2.48/1.55 #BackRed : 1
% 2.48/1.55
% 2.48/1.55 #Partial instantiations: 0
% 2.48/1.55 #Strategies tried : 1
% 2.48/1.55
% 2.48/1.55 Timing (in seconds)
% 2.48/1.55 ----------------------
% 2.48/1.55 Preprocessing : 0.36
% 2.48/1.55 Parsing : 0.21
% 2.48/1.55 CNF conversion : 0.02
% 2.48/1.55 Main loop : 0.17
% 2.48/1.55 Inferencing : 0.09
% 2.48/1.55 Reduction : 0.03
% 2.48/1.55 Demodulation : 0.02
% 2.48/1.55 BG Simplification : 0.01
% 2.48/1.55 Subsumption : 0.03
% 2.48/1.55 Abstraction : 0.01
% 2.48/1.55 MUC search : 0.00
% 2.48/1.55 Cooper : 0.00
% 2.48/1.55 Total : 0.57
% 2.48/1.55 Index Insertion : 0.00
% 2.48/1.55 Index Deletion : 0.00
% 2.48/1.55 Index Matching : 0.00
% 2.48/1.55 BG Taut test : 0.00
%------------------------------------------------------------------------------