TSTP Solution File: SYN045+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN045+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 : 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:06 EDT 2023
% Result : Theorem 2.06s 1.46s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 13 ( 4 ~; 6 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff(q,type,
q: $o ).
tff(r,type,
r: $o ).
tff(f_39,negated_conjecture,
~ ( ( p
| ( q
& r ) )
<=> ( ( p
| q )
& ( p
| r ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel13) ).
tff(c_20,plain,
~ p,
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_48,plain,
( q
| p ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_49,plain,
q,
inference(negUnitSimplification,[status(thm)],[c_20,c_48]) ).
tff(c_34,plain,
( r
| p ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_50,plain,
r,
inference(negUnitSimplification,[status(thm)],[c_20,c_34]) ).
tff(c_2,plain,
( ~ r
| ~ q ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_64,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_49,c_50,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN045+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/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.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:16:11 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.06/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.06/1.46
% 2.06/1.46 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.06/1.50
% 2.06/1.50 Inference rules
% 2.06/1.50 ----------------------
% 2.06/1.50 #Ref : 0
% 2.06/1.50 #Sup : 0
% 2.06/1.50 #Fact : 0
% 2.06/1.50 #Define : 0
% 2.06/1.50 #Split : 0
% 2.06/1.50 #Chain : 0
% 2.06/1.50 #Close : 0
% 2.06/1.50
% 2.06/1.50 Ordering : KBO
% 2.06/1.50
% 2.06/1.50 Simplification rules
% 2.06/1.50 ----------------------
% 2.06/1.50 #Subsume : 11
% 2.06/1.50 #Demod : 12
% 2.06/1.50 #Tautology : 12
% 2.06/1.50 #SimpNegUnit : 2
% 2.06/1.50 #BackRed : 0
% 2.06/1.50
% 2.06/1.50 #Partial instantiations: 0
% 2.06/1.50 #Strategies tried : 1
% 2.06/1.50
% 2.06/1.50 Timing (in seconds)
% 2.06/1.50 ----------------------
% 2.06/1.50 Preprocessing : 0.37
% 2.06/1.50 Parsing : 0.18
% 2.06/1.50 CNF conversion : 0.02
% 2.06/1.50 Main loop : 0.06
% 2.06/1.50 Inferencing : 0.00
% 2.06/1.50 Reduction : 0.02
% 2.06/1.50 Demodulation : 0.02
% 2.06/1.50 BG Simplification : 0.01
% 2.06/1.50 Subsumption : 0.03
% 2.06/1.50 Abstraction : 0.01
% 2.06/1.50 MUC search : 0.00
% 2.06/1.50 Cooper : 0.00
% 2.06/1.50 Total : 0.48
% 2.06/1.50 Index Insertion : 0.00
% 2.06/1.50 Index Deletion : 0.00
% 2.06/1.50 Index Matching : 0.00
% 2.06/1.50 BG Taut test : 0.00
%------------------------------------------------------------------------------