TSTP Solution File: ROB030-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ROB030-1 : TPTP v8.1.2. Released v3.1.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 : n026.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:55:06 EDT 2023
% Result : Unsatisfiable 2.21s 1.61s
% Output : CNFRefutation 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 5 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ add > #nlpp > negate > d > c
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(add,type,
add: ( $i * $i ) > $i ).
tff(negate,type,
negate: $i > $i ).
tff(d,type,
d: $i ).
tff(c,type,
c: $i ).
tff(f_55,axiom,
add(c,d) = d,
file(unknown,unknown) ).
tff(f_58,axiom,
! [A,B] : ( negate(add(A,B)) != negate(B) ),
file(unknown,unknown) ).
tff(c_8,plain,
add(c,d) = d,
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_48,plain,
! [A_12,B_13] : ( negate(add(A_12,B_13)) != negate(B_13) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_59,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_8,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ROB030-1 : TPTP v8.1.2. Released v3.1.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.20/0.35 % Computer : n026.cluster.edu
% 0.20/0.35 % Model : x86_64 x86_64
% 0.20/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.35 % Memory : 8042.1875MB
% 0.20/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 300
% 0.20/0.35 % DateTime : Thu Aug 3 20:50:47 EDT 2023
% 0.20/0.35 % CPUTime :
% 2.21/1.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.21/1.61
% 2.21/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.21/1.63
% 2.21/1.63 Inference rules
% 2.21/1.63 ----------------------
% 2.21/1.63 #Ref : 0
% 2.21/1.63 #Sup : 13
% 2.21/1.63 #Fact : 0
% 2.21/1.63 #Define : 0
% 2.21/1.63 #Split : 0
% 2.21/1.63 #Chain : 0
% 2.21/1.63 #Close : 0
% 2.21/1.63
% 2.21/1.63 Ordering : KBO
% 2.21/1.63
% 2.21/1.63 Simplification rules
% 2.21/1.63 ----------------------
% 2.21/1.63 #Subsume : 0
% 2.21/1.63 #Demod : 0
% 2.21/1.63 #Tautology : 10
% 2.21/1.63 #SimpNegUnit : 0
% 2.21/1.63 #BackRed : 0
% 2.21/1.63
% 2.21/1.63 #Partial instantiations: 0
% 2.21/1.63 #Strategies tried : 1
% 2.21/1.63
% 2.21/1.63 Timing (in seconds)
% 2.21/1.63 ----------------------
% 2.21/1.64 Preprocessing : 0.41
% 2.21/1.64 Parsing : 0.21
% 2.21/1.64 CNF conversion : 0.02
% 2.21/1.64 Main loop : 0.16
% 2.21/1.64 Inferencing : 0.06
% 2.21/1.64 Reduction : 0.05
% 2.21/1.64 Demodulation : 0.04
% 2.21/1.64 BG Simplification : 0.01
% 2.21/1.64 Subsumption : 0.03
% 2.21/1.64 Abstraction : 0.01
% 2.21/1.64 MUC search : 0.00
% 2.21/1.64 Cooper : 0.00
% 2.21/1.64 Total : 0.60
% 2.21/1.64 Index Insertion : 0.00
% 2.21/1.64 Index Deletion : 0.00
% 2.21/1.64 Index Matching : 0.00
% 2.21/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------