TSTP Solution File: SYN047+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN047+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n001.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:06 EDT 2023
% Result : Theorem 2.14s 1.49s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 27 ( 11 ~; 11 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > s > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff(q,type,
q: $o ).
tff(s,type,
s: $o ).
tff(r,type,
r: $o ).
tff(f_51,negated_conjecture,
~ ( ( ( p
& ( q
=> r ) )
=> s )
<=> ( ( ~ p
| q
| s )
& ( ~ p
| ~ r
| s ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel17) ).
tff(c_2,plain,
~ s,
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_62,plain,
p,
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_86,plain,
( s
| ~ r
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_114,plain,
( s
| ~ r ),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_86]) ).
tff(c_134,plain,
~ r,
inference(negUnitSimplification,[status(thm)],[c_2,c_114]) ).
tff(c_110,plain,
( s
| q
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_112,plain,
( s
| q ),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_110]) ).
tff(c_133,plain,
q,
inference(negUnitSimplification,[status(thm)],[c_2,c_112]) ).
tff(c_32,plain,
( r
| ~ q ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_136,plain,
r,
inference(demodulation,[status(thm),theory(equality)],[c_133,c_32]) ).
tff(c_137,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_134,c_136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN047+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.33 % Computer : n001.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 18:05:40 EDT 2023
% 0.13/0.33 % CPUTime :
% 2.14/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.14/1.49
% 2.14/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.14/1.53
% 2.14/1.53 Inference rules
% 2.14/1.53 ----------------------
% 2.14/1.53 #Ref : 0
% 2.14/1.53 #Sup : 0
% 2.14/1.53 #Fact : 0
% 2.14/1.53 #Define : 0
% 2.14/1.53 #Split : 0
% 2.14/1.53 #Chain : 0
% 2.14/1.53 #Close : 0
% 2.14/1.53
% 2.14/1.53 Ordering : KBO
% 2.14/1.53
% 2.14/1.53 Simplification rules
% 2.14/1.53 ----------------------
% 2.14/1.53 #Subsume : 13
% 2.14/1.53 #Demod : 21
% 2.14/1.53 #Tautology : 41
% 2.14/1.53 #SimpNegUnit : 3
% 2.14/1.53 #BackRed : 0
% 2.14/1.53
% 2.14/1.53 #Partial instantiations: 0
% 2.14/1.53 #Strategies tried : 1
% 2.14/1.53
% 2.14/1.53 Timing (in seconds)
% 2.14/1.53 ----------------------
% 2.14/1.53 Preprocessing : 0.41
% 2.14/1.53 Parsing : 0.19
% 2.14/1.53 CNF conversion : 0.03
% 2.14/1.53 Main loop : 0.08
% 2.14/1.53 Inferencing : 0.00
% 2.14/1.53 Reduction : 0.03
% 2.14/1.53 Demodulation : 0.02
% 2.14/1.53 BG Simplification : 0.02
% 2.14/1.53 Subsumption : 0.04
% 2.14/1.53 Abstraction : 0.01
% 2.14/1.53 MUC search : 0.00
% 2.14/1.53 Cooper : 0.00
% 2.14/1.53 Total : 0.54
% 2.14/1.53 Index Insertion : 0.00
% 2.14/1.53 Index Deletion : 0.00
% 2.14/1.53 Index Matching : 0.00
% 2.14/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------