TSTP Solution File: SYN379+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN379+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 : n031.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 1.93s 1.42s
% Output : CNFRefutation 2.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of formulae : 6 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 10 (; 9 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_q,type,
big_q: ( $i * $i * $i ) > $o ).
tff(big_p,type,
big_p: $i > $o ).
tff(f_39,negated_conjecture,
~ ( ! [X] : big_p(X)
=> ? [Y] :
( ! [X,Z] : big_q(X,Y,Z)
=> ~ ! [Z] :
( big_p(Z)
& ~ big_q(Y,Y,Z) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2131) ).
tff(c_2,plain,
! [X_7,Y_2,Z_8] : big_q(X_7,Y_2,Z_8),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_6,plain,
! [Y_2,Z_6] : ~ big_q(Y_2,Y_2,Z_6),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_11,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN379+1 : TPTP v8.1.2. Released v2.0.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.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:51:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 1.93/1.42 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.93/1.42
% 1.93/1.42 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.20/1.46
% 2.20/1.46 Inference rules
% 2.20/1.46 ----------------------
% 2.20/1.46 #Ref : 0
% 2.20/1.46 #Sup : 0
% 2.20/1.46 #Fact : 0
% 2.20/1.46 #Define : 0
% 2.20/1.46 #Split : 0
% 2.20/1.46 #Chain : 0
% 2.20/1.46 #Close : 0
% 2.20/1.46
% 2.20/1.46 Ordering : KBO
% 2.20/1.46
% 2.20/1.46 Simplification rules
% 2.20/1.46 ----------------------
% 2.20/1.46 #Subsume : 2
% 2.20/1.46 #Demod : 2
% 2.20/1.46 #Tautology : 1
% 2.20/1.46 #SimpNegUnit : 0
% 2.20/1.46 #BackRed : 0
% 2.20/1.46
% 2.20/1.46 #Partial instantiations: 0
% 2.20/1.46 #Strategies tried : 1
% 2.20/1.46
% 2.20/1.46 Timing (in seconds)
% 2.20/1.46 ----------------------
% 2.20/1.46 Preprocessing : 0.37
% 2.20/1.46 Parsing : 0.21
% 2.20/1.46 CNF conversion : 0.02
% 2.20/1.46 Main loop : 0.05
% 2.20/1.47 Inferencing : 0.00
% 2.20/1.47 Reduction : 0.02
% 2.20/1.47 Demodulation : 0.02
% 2.20/1.47 BG Simplification : 0.01
% 2.20/1.47 Subsumption : 0.02
% 2.20/1.47 Abstraction : 0.00
% 2.20/1.47 MUC search : 0.00
% 2.20/1.47 Cooper : 0.00
% 2.20/1.47 Total : 0.47
% 2.20/1.47 Index Insertion : 0.00
% 2.20/1.47 Index Deletion : 0.00
% 2.20/1.47 Index Matching : 0.00
% 2.20/1.47 BG Taut test : 0.00
%------------------------------------------------------------------------------