TSTP Solution File: NUM383+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM383+1 : TPTP v8.1.2. Released v3.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 : n019.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:51:34 EDT 2023
% Result : Theorem 4.01s 1.94s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 30
% Syntax : Number of formulae : 49 ( 6 unt; 24 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 59 ( 28 ~; 23 |; 4 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 11 >; 3 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-1 aty)
% Number of variables : 40 (; 40 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_non_empty > relation_empty_yielding > relation > one_to_one > function > empty > #nlpp > powerset > empty_set > #skF_11 > #skF_1 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_13 > #skF_2 > #skF_3 > #skF_9 > #skF_8 > #skF_4 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(relation_non_empty,type,
relation_non_empty: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_153,negated_conjecture,
~ ! [A,B] :
~ ( in(A,B)
& subset(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_ordinal1) ).
tff(f_125,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
tff(f_138,axiom,
! [A,B,C] :
~ ( in(A,B)
& element(B,powerset(C))
& empty(C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
tff(f_131,axiom,
! [A,B,C] :
( ( in(A,B)
& element(B,powerset(C)) )
=> element(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
tff(f_121,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
tff(f_31,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
tff(c_90,plain,
subset('#skF_13','#skF_12'),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_92,plain,
in('#skF_12','#skF_13'),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_80,plain,
! [A_14,B_15] :
( element(A_14,powerset(B_15))
| ~ subset(A_14,B_15) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_262,plain,
! [C_49,B_50,A_51] :
( ~ empty(C_49)
| ~ element(B_50,powerset(C_49))
| ~ in(A_51,B_50) ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_288,plain,
! [B_58,A_59,A_60] :
( ~ empty(B_58)
| ~ in(A_59,A_60)
| ~ subset(A_60,B_58) ),
inference(resolution,[status(thm)],[c_80,c_262]) ).
tff(c_295,plain,
! [B_61] :
( ~ empty(B_61)
| ~ subset('#skF_13',B_61) ),
inference(resolution,[status(thm)],[c_92,c_288]) ).
tff(c_304,plain,
~ empty('#skF_12'),
inference(resolution,[status(thm)],[c_90,c_295]) ).
tff(c_272,plain,
! [A_52,C_53,B_54] :
( element(A_52,C_53)
| ~ element(B_54,powerset(C_53))
| ~ in(A_52,B_54) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_321,plain,
! [A_66,B_67,A_68] :
( element(A_66,B_67)
| ~ in(A_66,A_68)
| ~ subset(A_68,B_67) ),
inference(resolution,[status(thm)],[c_80,c_272]) ).
tff(c_328,plain,
! [B_69] :
( element('#skF_12',B_69)
| ~ subset('#skF_13',B_69) ),
inference(resolution,[status(thm)],[c_92,c_321]) ).
tff(c_338,plain,
element('#skF_12','#skF_12'),
inference(resolution,[status(thm)],[c_90,c_328]) ).
tff(c_76,plain,
! [A_12,B_13] :
( in(A_12,B_13)
| empty(B_13)
| ~ element(A_12,B_13) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_201,plain,
! [A_46,B_47] :
( in(A_46,B_47)
| empty(B_47)
| ~ element(A_46,B_47) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_2,plain,
! [B_2,A_1] :
( ~ in(B_2,A_1)
| ~ in(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_305,plain,
! [B_62,A_63] :
( ~ in(B_62,A_63)
| empty(B_62)
| ~ element(A_63,B_62) ),
inference(resolution,[status(thm)],[c_201,c_2]) ).
tff(c_339,plain,
! [A_70,B_71] :
( empty(A_70)
| ~ element(B_71,A_70)
| empty(B_71)
| ~ element(A_70,B_71) ),
inference(resolution,[status(thm)],[c_76,c_305]) ).
tff(c_341,plain,
( empty('#skF_12')
| ~ element('#skF_12','#skF_12') ),
inference(resolution,[status(thm)],[c_338,c_339]) ).
tff(c_350,plain,
empty('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_338,c_341]) ).
tff(c_352,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_304,c_350]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM383+1 : TPTP v8.1.2. Released v3.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.36 % Computer : n019.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 15:02:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.01/1.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.01/1.95
% 4.01/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.12/1.97
% 4.12/1.97 Inference rules
% 4.12/1.97 ----------------------
% 4.12/1.97 #Ref : 0
% 4.12/1.97 #Sup : 55
% 4.12/1.97 #Fact : 0
% 4.12/1.97 #Define : 0
% 4.12/1.98 #Split : 5
% 4.12/1.98 #Chain : 0
% 4.12/1.98 #Close : 0
% 4.12/1.98
% 4.12/1.98 Ordering : KBO
% 4.12/1.98
% 4.12/1.98 Simplification rules
% 4.12/1.98 ----------------------
% 4.12/1.98 #Subsume : 5
% 4.12/1.98 #Demod : 33
% 4.12/1.98 #Tautology : 29
% 4.12/1.98 #SimpNegUnit : 2
% 4.12/1.98 #BackRed : 13
% 4.12/1.98
% 4.12/1.98 #Partial instantiations: 0
% 4.12/1.98 #Strategies tried : 1
% 4.12/1.98
% 4.12/1.98 Timing (in seconds)
% 4.12/1.98 ----------------------
% 4.12/1.98 Preprocessing : 0.50
% 4.12/1.98 Parsing : 0.27
% 4.12/1.98 CNF conversion : 0.04
% 4.12/1.98 Main loop : 0.41
% 4.12/1.98 Inferencing : 0.15
% 4.12/1.98 Reduction : 0.12
% 4.12/1.98 Demodulation : 0.08
% 4.12/1.98 BG Simplification : 0.02
% 4.12/1.98 Subsumption : 0.08
% 4.12/1.98 Abstraction : 0.01
% 4.12/1.98 MUC search : 0.00
% 4.12/1.98 Cooper : 0.00
% 4.12/1.98 Total : 0.95
% 4.12/1.98 Index Insertion : 0.00
% 4.12/1.98 Index Deletion : 0.00
% 4.12/1.98 Index Matching : 0.00
% 4.12/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------