TSTP Solution File: SYN360+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN360+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:37 EDT 2023
% Result : Theorem 2.42s 1.61s
% Output : CNFRefutation 2.42s
% 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 ~; 1 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 13 (; 11 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp > #skF_1 > #skF_2 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_p,type,
big_p: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(big_q,type,
big_q: ( $i * $i ) > $o ).
tff(f_39,negated_conjecture,
~ ( ( ! [X] :
( ? [Y] : big_p(X,Y)
=> ! [Y] : big_q(X,Y) )
& ! [Z] :
? [Y] : big_p(Z,Y) )
=> ! [Y,X] : big_q(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2111) ).
tff(c_4,plain,
! [Z_6] : big_p(Z_6,'#skF_1'(Z_6)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_8,plain,
! [X_9,Y_10,Y_11] :
( big_q(X_9,Y_10)
| ~ big_p(X_9,Y_11) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_11,plain,
! [Z_6,Y_10] : big_q(Z_6,Y_10),
inference(resolution,[status(thm)],[c_4,c_8]) ).
tff(c_2,plain,
~ big_q('#skF_3','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_15,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_11,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN360+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.36 % Computer : n010.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 17:02:43 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.42/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.42/1.62
% 2.42/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.42/1.65
% 2.42/1.65 Inference rules
% 2.42/1.65 ----------------------
% 2.42/1.65 #Ref : 0
% 2.42/1.65 #Sup : 1
% 2.42/1.65 #Fact : 0
% 2.42/1.65 #Define : 0
% 2.42/1.65 #Split : 0
% 2.42/1.65 #Chain : 0
% 2.42/1.65 #Close : 0
% 2.42/1.65
% 2.42/1.65 Ordering : KBO
% 2.42/1.65
% 2.42/1.65 Simplification rules
% 2.42/1.65 ----------------------
% 2.42/1.65 #Subsume : 0
% 2.42/1.65 #Demod : 2
% 2.42/1.65 #Tautology : 1
% 2.42/1.65 #SimpNegUnit : 0
% 2.42/1.65 #BackRed : 1
% 2.42/1.65
% 2.42/1.65 #Partial instantiations: 0
% 2.42/1.65 #Strategies tried : 1
% 2.42/1.65
% 2.42/1.65 Timing (in seconds)
% 2.42/1.65 ----------------------
% 2.42/1.66 Preprocessing : 0.40
% 2.42/1.66 Parsing : 0.22
% 2.42/1.66 CNF conversion : 0.03
% 2.42/1.66 Main loop : 0.12
% 2.42/1.66 Inferencing : 0.05
% 2.42/1.66 Reduction : 0.02
% 2.42/1.66 Demodulation : 0.02
% 2.42/1.66 BG Simplification : 0.01
% 2.42/1.66 Subsumption : 0.02
% 2.42/1.66 Abstraction : 0.00
% 2.42/1.66 MUC search : 0.00
% 2.42/1.66 Cooper : 0.00
% 2.42/1.66 Total : 0.57
% 2.42/1.66 Index Insertion : 0.00
% 2.42/1.66 Index Deletion : 0.00
% 2.42/1.66 Index Matching : 0.00
% 2.42/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------