TSTP Solution File: SYN063+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN063+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:09:12 EDT 2023
% Result : Theorem 2.23s 1.65s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 28 ( 10 ~; 13 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > c > b > a > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(c,type,
c: $i ).
tff(f_51,negated_conjecture,
~ ( ! [X] :
( ( big_p(a)
& ( big_p(X)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X1] :
( ( ~ big_p(a)
| big_p(X1)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel33) ).
tff(c_2,plain,
~ big_p(c),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_62,plain,
big_p(a),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_88,plain,
! [X_1,X1_2] :
( big_p(X_1)
| big_p(c)
| big_p(X1_2)
| ~ big_p(a) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_114,plain,
! [X_1,X1_2] :
( big_p(X_1)
| big_p(c)
| big_p(X1_2) ),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_88]) ).
tff(c_136,plain,
! [X_1,X1_2] :
( big_p(X_1)
| big_p(X1_2) ),
inference(negUnitSimplification,[status(thm)],[c_2,c_114]) ).
tff(c_138,plain,
! [X1_2] : big_p(X1_2),
inference(splitLeft,[status(thm)],[c_136]) ).
tff(c_108,plain,
( big_p(c)
| ~ big_p(b)
| ~ big_p(a) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_112,plain,
( big_p(c)
| ~ big_p(b) ),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_108]) ).
tff(c_135,plain,
~ big_p(b),
inference(negUnitSimplification,[status(thm)],[c_2,c_112]) ).
tff(c_144,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_138,c_135]) ).
tff(c_145,plain,
! [X_1] : big_p(X_1),
inference(splitRight,[status(thm)],[c_136]) ).
tff(c_151,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_145,c_135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN063+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 : n012.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:20:52 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.23/1.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/1.65
% 2.23/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.80/1.70
% 2.80/1.70 Inference rules
% 2.80/1.70 ----------------------
% 2.80/1.70 #Ref : 0
% 2.80/1.70 #Sup : 0
% 2.80/1.70 #Fact : 0
% 2.80/1.70 #Define : 0
% 2.80/1.70 #Split : 1
% 2.80/1.70 #Chain : 0
% 2.80/1.70 #Close : 0
% 2.80/1.70
% 2.80/1.70 Ordering : KBO
% 2.80/1.70
% 2.80/1.70 Simplification rules
% 2.80/1.70 ----------------------
% 2.80/1.70 #Subsume : 10
% 2.80/1.70 #Demod : 27
% 2.80/1.70 #Tautology : 42
% 2.80/1.70 #SimpNegUnit : 3
% 2.80/1.70 #BackRed : 4
% 2.80/1.70
% 2.80/1.70 #Partial instantiations: 0
% 2.80/1.70 #Strategies tried : 1
% 2.80/1.70
% 2.80/1.70 Timing (in seconds)
% 2.80/1.70 ----------------------
% 2.80/1.70 Preprocessing : 0.47
% 2.80/1.70 Parsing : 0.23
% 2.80/1.70 CNF conversion : 0.04
% 2.80/1.70 Main loop : 0.15
% 2.80/1.70 Inferencing : 0.03
% 2.80/1.70 Reduction : 0.04
% 2.80/1.70 Demodulation : 0.03
% 2.80/1.70 BG Simplification : 0.03
% 2.80/1.70 Subsumption : 0.04
% 2.80/1.70 Abstraction : 0.01
% 2.80/1.70 MUC search : 0.00
% 2.80/1.70 Cooper : 0.00
% 2.80/1.70 Total : 0.68
% 2.80/1.70 Index Insertion : 0.00
% 2.80/1.70 Index Deletion : 0.00
% 2.80/1.70 Index Matching : 0.00
% 2.80/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------