TSTP Solution File: SYN382+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN382+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:41 EDT 2023
% Result : Theorem 2.07s 1.54s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 11 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 10 (; 8 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(big_p,type,
big_p: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(big_q,type,
big_q: ( $i * $i ) > $o ).
tff(f_38,negated_conjecture,
~ ( ! [Z] :
? [X] :
( ! [Y] : big_p(X,Y)
| big_q(X,Z) )
=> ! [Y] :
? [X] :
( big_p(X,Y)
| big_q(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2134) ).
tff(c_9,plain,
! [Z_11,Y_12] :
( big_p('#skF_2'(Z_11),Y_12)
| big_q('#skF_1'(Z_11),Z_11) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_4,plain,
! [X_8] : ~ big_q(X_8,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_17,plain,
! [Y_13] : big_p('#skF_2'('#skF_3'),Y_13),
inference(resolution,[status(thm)],[c_9,c_4]) ).
tff(c_2,plain,
! [X_8] : ~ big_p(X_8,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_22,plain,
$false,
inference(resolution,[status(thm)],[c_17,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN382+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 : n010.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:03:43 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.07/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.07/1.54
% 2.07/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.39/1.57
% 2.39/1.57 Inference rules
% 2.39/1.57 ----------------------
% 2.39/1.57 #Ref : 0
% 2.39/1.57 #Sup : 2
% 2.39/1.57 #Fact : 0
% 2.39/1.57 #Define : 0
% 2.39/1.57 #Split : 0
% 2.39/1.57 #Chain : 0
% 2.39/1.57 #Close : 0
% 2.39/1.57
% 2.39/1.57 Ordering : KBO
% 2.39/1.57
% 2.39/1.57 Simplification rules
% 2.39/1.57 ----------------------
% 2.39/1.57 #Subsume : 0
% 2.39/1.57 #Demod : 0
% 2.39/1.57 #Tautology : 0
% 2.39/1.57 #SimpNegUnit : 0
% 2.39/1.57 #BackRed : 0
% 2.39/1.57
% 2.39/1.57 #Partial instantiations: 0
% 2.39/1.57 #Strategies tried : 1
% 2.39/1.57
% 2.39/1.57 Timing (in seconds)
% 2.39/1.57 ----------------------
% 2.39/1.57 Preprocessing : 0.39
% 2.39/1.57 Parsing : 0.22
% 2.39/1.57 CNF conversion : 0.03
% 2.39/1.57 Main loop : 0.14
% 2.39/1.57 Inferencing : 0.09
% 2.39/1.57 Reduction : 0.02
% 2.39/1.57 Demodulation : 0.01
% 2.39/1.57 BG Simplification : 0.01
% 2.39/1.57 Subsumption : 0.02
% 2.39/1.57 Abstraction : 0.00
% 2.39/1.57 MUC search : 0.00
% 2.39/1.57 Cooper : 0.00
% 2.39/1.57 Total : 0.57
% 2.39/1.57 Index Insertion : 0.00
% 2.39/1.58 Index Deletion : 0.00
% 2.39/1.58 Index Matching : 0.00
% 2.39/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------