TSTP Solution File: COL055-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL055-1 : TPTP v8.1.2. Released v1.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 10:34:55 EDT 2023
% Result : Unsatisfiable 2.08s 1.48s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 9 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 4 ~; 1 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ response > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(response,type,
response: ( $i * $i ) > $i ).
tff(f_26,axiom,
response(a,b) = b,
file(unknown,unknown) ).
tff(f_40,axiom,
! [Z,W] :
( ( response(a,Z) != W )
| ( response(a,W) != Z ) ),
file(unknown,unknown) ).
tff(c_2,plain,
response(a,b) = b,
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_9,plain,
! [W_3] : ( response(a,response(a,W_3)) != W_3 ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_12,plain,
response(a,b) != b,
inference(superposition,[status(thm),theory(equality)],[c_2,c_9]) ).
tff(c_15,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COL055-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.14/0.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:42:10 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.08/1.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/1.49
% 2.08/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.08/1.52
% 2.08/1.52 Inference rules
% 2.08/1.52 ----------------------
% 2.08/1.52 #Ref : 0
% 2.08/1.52 #Sup : 3
% 2.08/1.52 #Fact : 0
% 2.08/1.52 #Define : 0
% 2.08/1.52 #Split : 0
% 2.08/1.52 #Chain : 0
% 2.08/1.52 #Close : 0
% 2.08/1.52
% 2.08/1.52 Ordering : KBO
% 2.08/1.52
% 2.08/1.52 Simplification rules
% 2.08/1.52 ----------------------
% 2.08/1.52 #Subsume : 0
% 2.08/1.52 #Demod : 1
% 2.08/1.52 #Tautology : 2
% 2.08/1.52 #SimpNegUnit : 0
% 2.08/1.52 #BackRed : 0
% 2.08/1.52
% 2.08/1.52 #Partial instantiations: 0
% 2.08/1.52 #Strategies tried : 1
% 2.08/1.52
% 2.08/1.52 Timing (in seconds)
% 2.08/1.52 ----------------------
% 2.08/1.53 Preprocessing : 0.38
% 2.08/1.53 Parsing : 0.19
% 2.08/1.53 CNF conversion : 0.02
% 2.08/1.53 Main loop : 0.09
% 2.08/1.53 Inferencing : 0.03
% 2.08/1.53 Reduction : 0.02
% 2.08/1.53 Demodulation : 0.02
% 2.08/1.53 BG Simplification : 0.01
% 2.08/1.53 Subsumption : 0.02
% 2.08/1.53 Abstraction : 0.00
% 2.08/1.53 MUC search : 0.00
% 2.08/1.53 Cooper : 0.00
% 2.08/1.53 Total : 0.52
% 2.08/1.53 Index Insertion : 0.00
% 2.08/1.53 Index Deletion : 0.00
% 2.08/1.53 Index Matching : 0.00
% 2.08/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------