TSTP Solution File: ALG198+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG198+1 : TPTP v8.1.2. Released v2.7.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 : n007.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 10:32:19 EDT 2023
% Result : Theorem 5.08s 2.13s
% Output : CNFRefutation 5.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of formulae : 12 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 23 ( 10 ~; 0 |; 13 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ op > #nlpp > e6 > e5 > e4 > e3 > e2 > e1 > e0
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(e1,type,
e1: $i ).
tff(e0,type,
e0: $i ).
tff(e2,type,
e2: $i ).
tff(op,type,
op: ( $i * $i ) > $i ).
tff(e4,type,
e4: $i ).
tff(e6,type,
e6: $i ).
tff(e3,type,
e3: $i ).
tff(e5,type,
e5: $i ).
tff(f_3168,negated_conjecture,
~ ~ ( ( op(e0,e0) != e0 )
& ( op(e1,e1) != e1 )
& ( op(e2,e2) != e2 )
& ( op(e3,e3) != e3 )
& ( op(e4,e4) != e4 )
& ( op(e5,e5) != e5 )
& ( op(e6,e6) != e6 )
& ( op(e0,e0) = e0 )
& ( op(e1,e1) = e1 )
& ( op(e2,e2) = e2 )
& ( op(e3,e3) = e3 )
& ( op(e4,e4) = e4 )
& ( op(e5,e5) = e5 )
& ( op(e6,e6) = e6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_1062,plain,
op(e0,e0) != e0,
inference(cnfTransformation,[status(thm)],[f_3168]) ).
tff(c_1048,plain,
op(e0,e0) = e0,
inference(cnfTransformation,[status(thm)],[f_3168]) ).
tff(c_1063,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1062,c_1048]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ALG198+1 : TPTP v8.1.2. Released v2.7.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 : n007.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.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 20:13:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.08/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.08/2.13
% 5.08/2.13 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.08/2.16
% 5.08/2.16 Inference rules
% 5.08/2.16 ----------------------
% 5.08/2.16 #Ref : 0
% 5.08/2.16 #Sup : 0
% 5.08/2.16 #Fact : 0
% 5.08/2.16 #Define : 0
% 5.08/2.16 #Split : 0
% 5.08/2.16 #Chain : 0
% 5.08/2.16 #Close : 0
% 5.08/2.16
% 5.08/2.16 Ordering : KBO
% 5.08/2.16
% 5.08/2.16 Simplification rules
% 5.08/2.16 ----------------------
% 5.08/2.16 #Subsume : 530
% 5.08/2.16 #Demod : 0
% 5.08/2.16 #Tautology : 0
% 5.08/2.16 #SimpNegUnit : 1
% 5.08/2.16 #BackRed : 0
% 5.08/2.16
% 5.08/2.16 #Partial instantiations: 0
% 5.08/2.16 #Strategies tried : 1
% 5.08/2.16
% 5.08/2.16 Timing (in seconds)
% 5.08/2.16 ----------------------
% 5.08/2.16 Preprocessing : 1.05
% 5.08/2.16 Parsing : 0.56
% 5.08/2.16 CNF conversion : 0.06
% 5.08/2.16 Main loop : 0.08
% 5.08/2.16 Inferencing : 0.00
% 5.08/2.16 Reduction : 0.03
% 5.08/2.16 Demodulation : 0.01
% 5.08/2.16 BG Simplification : 0.09
% 5.08/2.16 Subsumption : 0.04
% 5.08/2.16 Abstraction : 0.02
% 5.08/2.16 MUC search : 0.00
% 5.08/2.16 Cooper : 0.00
% 5.08/2.16 Total : 1.17
% 5.08/2.16 Index Insertion : 0.00
% 5.08/2.16 Index Deletion : 0.00
% 5.08/2.16 Index Matching : 0.00
% 5.08/2.16 BG Taut test : 0.00
%------------------------------------------------------------------------------