TSTP Solution File: REL003+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n014.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:54:24 EDT 2023
% Result : Theorem 3.40s 2.04s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 43 ( 19 unt; 12 typ; 0 def)
% Number of atoms : 45 ( 42 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 13 ~; 11 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > composition > #nlpp > converse > complement > zero > top > one > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(top,type,
top: $i ).
tff(converse,type,
converse: $i > $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(composition,type,
composition: ( $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(zero,type,
zero: $i ).
tff(f_54,axiom,
! [X0,X1] : ( join(X0,X1) = join(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
tff(f_92,negated_conjecture,
~ ! [X0,X1] :
( ( ( join(X0,X1) = X1 )
=> ( join(converse(X0),converse(X1)) = converse(X1) ) )
& ( ( join(converse(X0),converse(X1)) = converse(X1) )
=> ( join(X0,X1) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(f_70,axiom,
! [X0] : ( converse(converse(X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
tff(f_72,axiom,
! [X0,X1] : ( converse(join(X0,X1)) = join(converse(X0),converse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
tff(c_2,plain,
! [X1_2,X0_1] : ( join(X1_2,X0_1) = join(X0_1,X1_2) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_32,plain,
( ( join('#skF_1','#skF_2') != '#skF_2' )
| ( join('#skF_3','#skF_4') = '#skF_4' ) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_39,plain,
( ( join('#skF_1','#skF_2') != '#skF_2' )
| ( join('#skF_4','#skF_3') = '#skF_4' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_32]) ).
tff(c_116,plain,
join('#skF_1','#skF_2') != '#skF_2',
inference(splitLeft,[status(thm)],[c_39]) ).
tff(c_16,plain,
! [X0_17] : ( converse(converse(X0_17)) = X0_17 ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_18,plain,
! [X0_18,X1_19] : ( join(converse(X0_18),converse(X1_19)) = converse(join(X0_18,X1_19)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_34,plain,
( ( join(converse('#skF_1'),converse('#skF_2')) = converse('#skF_2') )
| ( join('#skF_3','#skF_4') = '#skF_4' ) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_35,plain,
( ( converse(join('#skF_1','#skF_2')) = converse('#skF_2') )
| ( join('#skF_3','#skF_4') = '#skF_4' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_34]) ).
tff(c_41,plain,
( ( converse(join('#skF_1','#skF_2')) = converse('#skF_2') )
| ( join('#skF_4','#skF_3') = '#skF_4' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_35]) ).
tff(c_159,plain,
join('#skF_4','#skF_3') = '#skF_4',
inference(splitLeft,[status(thm)],[c_41]) ).
tff(c_30,plain,
( ( join(converse('#skF_1'),converse('#skF_2')) = converse('#skF_2') )
| ( join(converse('#skF_3'),converse('#skF_4')) != converse('#skF_4') ) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_36,plain,
( ( converse(join('#skF_1','#skF_2')) = converse('#skF_2') )
| ( converse(join('#skF_3','#skF_4')) != converse('#skF_4') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_18,c_30]) ).
tff(c_42,plain,
( ( converse(join('#skF_1','#skF_2')) = converse('#skF_2') )
| ( converse(join('#skF_4','#skF_3')) != converse('#skF_4') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_36]) ).
tff(c_572,plain,
converse(join('#skF_1','#skF_2')) = converse('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_159,c_42]) ).
tff(c_588,plain,
converse(converse('#skF_2')) = join('#skF_1','#skF_2'),
inference(superposition,[status(thm),theory(equality)],[c_572,c_16]) ).
tff(c_595,plain,
join('#skF_1','#skF_2') = '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_16,c_588]) ).
tff(c_597,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_116,c_595]) ).
tff(c_598,plain,
converse(join('#skF_1','#skF_2')) = converse('#skF_2'),
inference(splitRight,[status(thm)],[c_41]) ).
tff(c_615,plain,
converse(converse('#skF_2')) = join('#skF_1','#skF_2'),
inference(superposition,[status(thm),theory(equality)],[c_598,c_16]) ).
tff(c_622,plain,
join('#skF_1','#skF_2') = '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_16,c_615]) ).
tff(c_624,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_116,c_622]) ).
tff(c_625,plain,
join('#skF_4','#skF_3') = '#skF_4',
inference(splitRight,[status(thm)],[c_39]) ).
tff(c_626,plain,
join('#skF_1','#skF_2') = '#skF_2',
inference(splitRight,[status(thm)],[c_39]) ).
tff(c_28,plain,
( ( join('#skF_1','#skF_2') != '#skF_2' )
| ( join(converse('#skF_3'),converse('#skF_4')) != converse('#skF_4') ) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_37,plain,
( ( join('#skF_1','#skF_2') != '#skF_2' )
| ( converse(join('#skF_3','#skF_4')) != converse('#skF_4') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_28]) ).
tff(c_40,plain,
( ( join('#skF_1','#skF_2') != '#skF_2' )
| ( converse(join('#skF_4','#skF_3')) != converse('#skF_4') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_37]) ).
tff(c_951,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_625,c_626,c_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.09 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.29 % Computer : n014.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Thu Aug 3 15:35:03 EDT 2023
% 0.09/0.29 % CPUTime :
% 3.40/2.04 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.40/2.04
% 3.40/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.40/2.07
% 3.40/2.07 Inference rules
% 3.40/2.07 ----------------------
% 3.40/2.07 #Ref : 0
% 3.40/2.07 #Sup : 256
% 3.40/2.07 #Fact : 0
% 3.40/2.07 #Define : 0
% 3.40/2.07 #Split : 2
% 3.40/2.07 #Chain : 0
% 3.40/2.07 #Close : 0
% 3.40/2.07
% 3.40/2.07 Ordering : KBO
% 3.40/2.07
% 3.40/2.07 Simplification rules
% 3.40/2.07 ----------------------
% 3.40/2.07 #Subsume : 4
% 3.40/2.07 #Demod : 91
% 3.40/2.07 #Tautology : 117
% 3.40/2.07 #SimpNegUnit : 2
% 3.40/2.07 #BackRed : 0
% 3.40/2.07
% 3.40/2.07 #Partial instantiations: 0
% 3.40/2.07 #Strategies tried : 1
% 3.40/2.07
% 3.40/2.07 Timing (in seconds)
% 3.40/2.07 ----------------------
% 3.40/2.07 Preprocessing : 0.46
% 3.40/2.07 Parsing : 0.25
% 3.40/2.07 CNF conversion : 0.03
% 3.40/2.07 Main loop : 0.49
% 3.40/2.07 Inferencing : 0.16
% 3.40/2.07 Reduction : 0.18
% 3.40/2.07 Demodulation : 0.15
% 3.40/2.07 BG Simplification : 0.02
% 3.40/2.07 Subsumption : 0.10
% 3.40/2.07 Abstraction : 0.02
% 3.40/2.08 MUC search : 0.00
% 3.40/2.08 Cooper : 0.00
% 3.40/2.08 Total : 1.00
% 3.40/2.08 Index Insertion : 0.00
% 3.40/2.08 Index Deletion : 0.00
% 3.40/2.08 Index Matching : 0.00
% 3.40/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------