TSTP Solution File: SWB015+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB015+2 : TPTP v8.1.2. Released v5.2.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 : n018.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:00:23 EDT 2023
% Result : Theorem 2.12s 1.47s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of formulae : 7 ( 4 unt; 2 typ; 0 def)
% Number of atoms : 6 ( 1 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 1 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > #nlpp > uri_owl_sameAs
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(uri_owl_sameAs,type,
uri_owl_sameAs: $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff(f_28,axiom,
! [X,Y] :
( iext(uri_owl_sameAs,X,Y)
<=> ( X = Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_eqdis_sameas) ).
tff(f_30,negated_conjecture,
~ iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_015_Reflective_Tautologies_I) ).
tff(c_4,plain,
! [Y_2] : iext(uri_owl_sameAs,Y_2,Y_2),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_6,plain,
~ iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_8,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWB015+2 : TPTP v8.1.2. Released v5.2.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.37 % Computer : n018.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 18:30:06 EDT 2023
% 0.14/0.37 % CPUTime :
% 2.12/1.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.12/1.47
% 2.12/1.47 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.12/1.51
% 2.12/1.51 Inference rules
% 2.12/1.51 ----------------------
% 2.12/1.51 #Ref : 0
% 2.12/1.51 #Sup : 0
% 2.12/1.51 #Fact : 0
% 2.12/1.51 #Define : 0
% 2.12/1.51 #Split : 0
% 2.12/1.51 #Chain : 0
% 2.12/1.51 #Close : 0
% 2.12/1.51
% 2.12/1.51 Ordering : KBO
% 2.12/1.51
% 2.12/1.51 Simplification rules
% 2.12/1.51 ----------------------
% 2.12/1.51 #Subsume : 2
% 2.12/1.51 #Demod : 1
% 2.12/1.51 #Tautology : 0
% 2.12/1.51 #SimpNegUnit : 0
% 2.12/1.51 #BackRed : 0
% 2.12/1.51
% 2.12/1.51 #Partial instantiations: 0
% 2.12/1.51 #Strategies tried : 1
% 2.12/1.51
% 2.12/1.51 Timing (in seconds)
% 2.12/1.51 ----------------------
% 2.12/1.52 Preprocessing : 0.38
% 2.12/1.52 Parsing : 0.20
% 2.12/1.52 CNF conversion : 0.02
% 2.12/1.52 Main loop : 0.05
% 2.12/1.52 Inferencing : 0.00
% 2.12/1.52 Reduction : 0.02
% 2.12/1.52 Demodulation : 0.02
% 2.12/1.52 BG Simplification : 0.01
% 2.12/1.52 Subsumption : 0.02
% 2.12/1.52 Abstraction : 0.00
% 2.12/1.52 MUC search : 0.00
% 2.12/1.52 Cooper : 0.00
% 2.12/1.52 Total : 0.48
% 2.12/1.52 Index Insertion : 0.00
% 2.12/1.52 Index Deletion : 0.00
% 2.12/1.52 Index Matching : 0.00
% 2.12/1.52 BG Taut test : 0.00
%------------------------------------------------------------------------------