TSTP Solution File: SYN052+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN052+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 : n005.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:09:08 EDT 2023
% Result : Theorem 2.40s 1.63s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 7 unt; 3 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 4 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > p > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_f,type,
big_f: $i > $o ).
tff(f_35,negated_conjecture,
~ ( ! [X] :
( p
<=> big_f(X) )
=> ( p
<=> ! [X1] : big_f(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel22) ).
tff(c_12,plain,
! [X1_2] :
( p
| big_f(X1_2) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_13,plain,
p,
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_2,plain,
! [X_1] :
( big_f(X_1)
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_16,plain,
! [X_1] : big_f(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_2]) ).
tff(c_6,plain,
( ~ big_f('#skF_1')
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_19,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_13,c_16,c_6]) ).
tff(c_21,plain,
~ p,
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_20,plain,
! [X1_2] : big_f(X1_2),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_4,plain,
! [X_1] :
( p
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_26,plain,
p,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_4]) ).
tff(c_27,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_21,c_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : SYN052+1 : TPTP v8.1.2. Released v2.0.0.
% 0.14/0.15 % 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.37 % Computer : n005.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 17:09:11 EDT 2023
% 0.14/0.37 % CPUTime :
% 2.40/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.40/1.64
% 2.40/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.71/1.67
% 2.71/1.67 Inference rules
% 2.71/1.67 ----------------------
% 2.71/1.67 #Ref : 0
% 2.71/1.67 #Sup : 0
% 2.71/1.67 #Fact : 0
% 2.71/1.67 #Define : 0
% 2.71/1.67 #Split : 1
% 2.71/1.67 #Chain : 0
% 2.71/1.67 #Close : 0
% 2.71/1.67
% 2.71/1.67 Ordering : KBO
% 2.71/1.67
% 2.71/1.67 Simplification rules
% 2.71/1.67 ----------------------
% 2.71/1.67 #Subsume : 1
% 2.71/1.67 #Demod : 6
% 2.71/1.67 #Tautology : 2
% 2.71/1.67 #SimpNegUnit : 1
% 2.71/1.67 #BackRed : 0
% 2.71/1.67
% 2.71/1.67 #Partial instantiations: 0
% 2.71/1.67 #Strategies tried : 1
% 2.71/1.67
% 2.71/1.67 Timing (in seconds)
% 2.71/1.67 ----------------------
% 2.71/1.68 Preprocessing : 0.40
% 2.71/1.68 Parsing : 0.22
% 2.71/1.68 CNF conversion : 0.02
% 2.71/1.68 Main loop : 0.12
% 2.71/1.68 Inferencing : 0.04
% 2.71/1.68 Reduction : 0.02
% 2.71/1.68 Demodulation : 0.01
% 2.71/1.68 BG Simplification : 0.01
% 2.71/1.68 Subsumption : 0.03
% 2.71/1.68 Abstraction : 0.00
% 2.71/1.68 MUC search : 0.00
% 2.71/1.68 Cooper : 0.00
% 2.71/1.68 Total : 0.57
% 2.71/1.68 Index Insertion : 0.00
% 2.71/1.68 Index Deletion : 0.00
% 2.71/1.68 Index Matching : 0.00
% 2.71/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------