TSTP Solution File: REL001+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : REL001+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 : n024.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:23 EDT 2023
% Result : Theorem 4.55s 2.14s
% Output : CNFRefutation 4.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of formulae : 55 ( 46 unt; 9 typ; 0 def)
% Number of atoms : 46 ( 45 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 44 (; 44 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > composition > #nlpp > converse > complement > zero > top > one > #skF_1
%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_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(zero,type,
zero: $i ).
tff(f_53,axiom,
! [X0,X1] : ( join(X0,X1) = join(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
tff(f_80,axiom,
! [X0] : ( zero = meet(X0,complement(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
tff(f_78,axiom,
! [X0] : ( top = join(X0,complement(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_top) ).
tff(f_59,axiom,
! [X0,X1] : ( meet(X0,X1) = complement(join(complement(X0),complement(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
tff(f_57,axiom,
! [X0,X1] : ( X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
tff(f_55,axiom,
! [X0,X1,X2] : ( join(X0,join(X1,X2)) = join(join(X0,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
tff(f_85,negated_conjecture,
~ ! [X0] : ( join(zero,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(c_2,plain,
! [X1_2,X0_1] : ( join(X1_2,X0_1) = join(X0_1,X1_2) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_26,plain,
! [X0_25] : ( meet(X0_25,complement(X0_25)) = zero ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_24,plain,
! [X0_24] : ( join(X0_24,complement(X0_24)) = top ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_119,plain,
! [X0_34,X1_35] : ( complement(join(complement(X0_34),complement(X1_35))) = meet(X0_34,X1_35) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_153,plain,
! [X0_34] : ( meet(X0_34,complement(X0_34)) = complement(top) ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_119]) ).
tff(c_156,plain,
complement(top) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_153]) ).
tff(c_8,plain,
! [X0_8,X1_9] : ( complement(join(complement(X0_8),complement(X1_9))) = meet(X0_8,X1_9) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_6,plain,
! [X0_6,X1_7] : ( join(complement(join(complement(X0_6),complement(X1_7))),complement(join(complement(X0_6),X1_7))) = X0_6 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_522,plain,
! [X0_50,X1_51] : ( join(meet(X0_50,X1_51),complement(join(complement(X0_50),X1_51))) = X0_50 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_579,plain,
! [X0_50] : ( join(meet(X0_50,complement(complement(X0_50))),complement(top)) = X0_50 ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_522]) ).
tff(c_588,plain,
! [X0_50] : ( join(zero,meet(X0_50,complement(complement(X0_50)))) = X0_50 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_156,c_579]) ).
tff(c_169,plain,
join(top,zero) = top,
inference(superposition,[status(thm),theory(equality)],[c_156,c_24]) ).
tff(c_382,plain,
! [X0_44,X1_45,X2_46] : ( join(join(X0_44,X1_45),X2_46) = join(X0_44,join(X1_45,X2_46)) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_474,plain,
! [X2_49] : ( join(top,join(zero,X2_49)) = join(top,X2_49) ),
inference(superposition,[status(thm),theory(equality)],[c_169,c_382]) ).
tff(c_495,plain,
join(top,complement(zero)) = join(top,top),
inference(superposition,[status(thm),theory(equality)],[c_24,c_474]) ).
tff(c_163,plain,
! [X0_8] : ( complement(join(complement(X0_8),zero)) = meet(X0_8,top) ),
inference(superposition,[status(thm),theory(equality)],[c_156,c_8]) ).
tff(c_266,plain,
! [X0_39] : ( complement(join(zero,complement(X0_39))) = meet(X0_39,top) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_163]) ).
tff(c_315,plain,
meet(zero,top) = complement(top),
inference(superposition,[status(thm),theory(equality)],[c_24,c_266]) ).
tff(c_319,plain,
meet(zero,top) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_156,c_315]) ).
tff(c_543,plain,
join(zero,complement(join(complement(zero),top))) = zero,
inference(superposition,[status(thm),theory(equality)],[c_319,c_522]) ).
tff(c_585,plain,
join(zero,complement(join(top,top))) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_495,c_2,c_543]) ).
tff(c_407,plain,
! [X2_46] : ( join(top,join(zero,X2_46)) = join(top,X2_46) ),
inference(superposition,[status(thm),theory(equality)],[c_169,c_382]) ).
tff(c_608,plain,
join(top,complement(join(top,top))) = join(top,zero),
inference(superposition,[status(thm),theory(equality)],[c_585,c_407]) ).
tff(c_620,plain,
join(top,complement(join(top,top))) = top,
inference(demodulation,[status(thm),theory(equality)],[c_169,c_608]) ).
tff(c_172,plain,
! [X0_8] : ( complement(join(zero,complement(X0_8))) = meet(X0_8,top) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_163]) ).
tff(c_614,plain,
meet(join(top,top),top) = complement(zero),
inference(superposition,[status(thm),theory(equality)],[c_585,c_172]) ).
tff(c_29,plain,
! [X0_6,X1_7] : ( join(meet(X0_6,X1_7),complement(join(complement(X0_6),X1_7))) = X0_6 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_692,plain,
join(complement(zero),complement(join(complement(join(top,top)),top))) = join(top,top),
inference(superposition,[status(thm),theory(equality)],[c_614,c_29]) ).
tff(c_701,plain,
join(top,top) = top,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_156,c_2,c_620,c_2,c_692]) ).
tff(c_708,plain,
join(zero,complement(top)) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_701,c_585]) ).
tff(c_711,plain,
join(zero,zero) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_156,c_708]) ).
tff(c_4,plain,
! [X0_3,X1_4,X2_5] : ( join(join(X0_3,X1_4),X2_5) = join(X0_3,join(X1_4,X2_5)) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_1428,plain,
! [X2_69] : ( join(zero,join(zero,X2_69)) = join(zero,X2_69) ),
inference(superposition,[status(thm),theory(equality)],[c_711,c_4]) ).
tff(c_1496,plain,
! [X0_50] : ( join(zero,meet(X0_50,complement(complement(X0_50)))) = join(zero,X0_50) ),
inference(superposition,[status(thm),theory(equality)],[c_588,c_1428]) ).
tff(c_1547,plain,
! [X0_70] : ( join(zero,X0_70) = X0_70 ),
inference(demodulation,[status(thm),theory(equality)],[c_588,c_1496]) ).
tff(c_1617,plain,
! [X1_2] : ( join(X1_2,zero) = X1_2 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1547]) ).
tff(c_28,plain,
join(zero,'#skF_1') != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_30,plain,
join('#skF_1',zero) != '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_1692,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1617,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : REL001+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % 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.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 15:37:45 EDT 2023
% 0.13/0.36 % CPUTime :
% 4.55/2.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.55/2.15
% 4.55/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.87/2.18
% 4.87/2.18 Inference rules
% 4.87/2.18 ----------------------
% 4.87/2.18 #Ref : 0
% 4.87/2.18 #Sup : 438
% 4.87/2.18 #Fact : 0
% 4.87/2.18 #Define : 0
% 4.87/2.18 #Split : 0
% 4.87/2.18 #Chain : 0
% 4.87/2.18 #Close : 0
% 4.87/2.18
% 4.87/2.18 Ordering : KBO
% 4.87/2.18
% 4.87/2.18 Simplification rules
% 4.87/2.18 ----------------------
% 4.87/2.18 #Subsume : 5
% 4.87/2.18 #Demod : 373
% 4.87/2.18 #Tautology : 257
% 4.87/2.18 #SimpNegUnit : 0
% 4.87/2.18 #BackRed : 17
% 4.87/2.18
% 4.87/2.18 #Partial instantiations: 0
% 4.87/2.18 #Strategies tried : 1
% 4.87/2.18
% 4.87/2.18 Timing (in seconds)
% 4.87/2.18 ----------------------
% 4.87/2.18 Preprocessing : 0.46
% 4.87/2.18 Parsing : 0.25
% 4.87/2.18 CNF conversion : 0.03
% 4.87/2.18 Main loop : 0.65
% 4.87/2.18 Inferencing : 0.21
% 4.87/2.18 Reduction : 0.26
% 4.87/2.18 Demodulation : 0.22
% 4.87/2.18 BG Simplification : 0.03
% 4.87/2.18 Subsumption : 0.11
% 4.87/2.18 Abstraction : 0.03
% 4.87/2.18 MUC search : 0.00
% 4.87/2.18 Cooper : 0.00
% 4.87/2.18 Total : 1.16
% 4.87/2.18 Index Insertion : 0.00
% 4.87/2.18 Index Deletion : 0.00
% 4.87/2.18 Index Matching : 0.00
% 4.87/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------